Post Made Community Wiki by Dennis
9 added 248 characters in body

## Oasis

### Factoid

Oasis is a language made by Adnan specialized in number sequences.

You can try it online here.

### Length 1

n


Not very interesting, just push n (The current argument) and print it because implicit output.

### Length 2

n1


Same as the previous snippet, but give 1 for the argument 0.

Oasis programs can have a list of hardcoded definitions for special cases.

So n1 can be described in pseudocode as:

A(n) = n
A(0) = 1


Special cases and indexes are reversed, so to make

A(0) = 1
A(1) = 4


The correct special cases definition is 41

As @Adnan pointed it out, another interesting snippet is the fibonnaci sequence:

+T


Because T is replaced with 10, so this is expanded to

+10


Which mean

A(n) = A(n - 1) + A(n - 2)
A(0) = 0
A(1) = 1


### Length 3

n*1


Finally, an useful snippet!

This calculate a factorial.

     A(n) = n * A(n - 1)
n    Push n
*   Multiply two items on the stack
Because there is only one item on the stack, A(n-1) is pushed
1  A(0) = 1


### Length 4

n*x1


Showcase the command x (Double a number).

This is basically a factorial, but double the number returned by n*A(n-1).

A(n) = n * A(n - 1) * 2
A(0) = 1


### Length 5

Tnm>1


Calculate A000533

       A(n) = 10^n + 1
T      Push 10
n     Push n
m    Power
>   Increment
1  A(0) = 1


### Length 6

Tnm<9÷


A002275 aka repunits

        A(n) = (10^n - 1) / 9
T       Push 10
n      Push n
m     Power
<    Decrement
9   Push 9
÷  Floor divide


## Oasis

### Factoid

Oasis is a language made by Adnan specialized in number sequences.

You can try it online here.

### Length 1

n


Not very interesting, just push n (The current argument) and print it because implicit output.

### Length 2

n1


Same as the previous snippet, but give 1 for the argument 0.

Oasis programs can have a list of hardcoded definitions for special cases.

So n1 can be described in pseudocode as:

A(n) = n
A(0) = 1


Special cases and indexes are reversed, so to make

A(0) = 1
A(1) = 4


The correct special cases definition is 41

As @Adnan pointed it out, another interesting snippet is the fibonnaci sequence:

+T


Because T is replaced with 10, so this is expanded to

+10


Which mean

A(n) = A(n - 1) + A(n - 2)
A(0) = 0
A(1) = 1


### Length 3

n*1


Finally, an useful snippet!

This calculate a factorial.

     A(n) = n * A(n - 1)
n    Push n
*   Multiply two items on the stack
Because there is only one item on the stack, A(n-1) is pushed
1  A(0) = 1


### Length 4

n*x1


Showcase the command x (Double a number).

This is basically a factorial, but double the number returned by n*A(n-1).

A(n) = n * A(n - 1) * 2
A(0) = 1


### Length 5

Tnm>1


Calculate A000533

       A(n) = 10^n + 1
T      Push 10
n     Push n
m    Power
>   Increment
1  A(0) = 1


## Oasis

### Factoid

Oasis is a language made by Adnan specialized in number sequences.

You can try it online here.

### Length 1

n


Not very interesting, just push n (The current argument) and print it because implicit output.

### Length 2

n1


Same as the previous snippet, but give 1 for the argument 0.

Oasis programs can have a list of hardcoded definitions for special cases.

So n1 can be described in pseudocode as:

A(n) = n
A(0) = 1


Special cases and indexes are reversed, so to make

A(0) = 1
A(1) = 4


The correct special cases definition is 41

As @Adnan pointed it out, another interesting snippet is the fibonnaci sequence:

+T


Because T is replaced with 10, so this is expanded to

+10


Which mean

A(n) = A(n - 1) + A(n - 2)
A(0) = 0
A(1) = 1


### Length 3

n*1


Finally, an useful snippet!

This calculate a factorial.

     A(n) = n * A(n - 1)
n    Push n
*   Multiply two items on the stack
Because there is only one item on the stack, A(n-1) is pushed
1  A(0) = 1


### Length 4

n*x1


Showcase the command x (Double a number).

This is basically a factorial, but double the number returned by n*A(n-1).

A(n) = n * A(n - 1) * 2
A(0) = 1


### Length 5

Tnm>1


Calculate A000533

       A(n) = 10^n + 1
T      Push 10
n     Push n
m    Power
>   Increment
1  A(0) = 1


### Length 6

Tnm<9÷


A002275 aka repunits

        A(n) = (10^n - 1) / 9
T       Push 10
n      Push n
m     Power
<    Decrement
9   Push 9
÷  Floor divide

8 deleted 4 characters in body

## Oasis

### Factoid

Oasis is a language made by Adnan specialized in number sequences.

You can try it online here.

### Length 1

n


Not very interesting, just push n (The current argument) and print it because implicit output.

### Length 2

n1


Same as the previous snippet, but give 1 for the argument 0.

Oasis programs can have a list of hardcoded definitions for special cases.

So n1 can be described in pseudocode as:

A(n) := n
A(0) := 1


Special cases and indexes are reversed, so to make

A(0) := 1
A(1) := 4


The correct special cases definition is 41

As @Adnan pointed it out, another interesting snippet is the fibonnaci sequence:

+T


Because T is replaced with 10, so this is expanded to

+10


Which mean

A(n) = A(n - 1) + A(n - 2)
A(0) = 0
A(1) = 1


### Length 3

n*1


Finally, an useful snippet!

This calculate a factorial.

     A(n) = n * A(n - 1)
n    Push n
*   Multiply two items on the stack
Because there is only one item on the stack, A(n-1) is pushed
1  A(0) = 1


### Length 4

n*x1


Showcase the command x (Double a number).

This is basically a factorial, but double the number returned by n*A(n-1).

A(n) = n * A(n - 1) * 2
A(0) = 1


### Length 5

Tnm>1


Calculate A000533

       A(n) = 10^n + 1
T      Push 10
n     Push n
m    Power
>   Increment
1  A(0) = 1


## Oasis

### Factoid

Oasis is a language made by Adnan specialized in number sequences.

You can try it online here.

### Length 1

n


Not very interesting, just push n (The current argument) and print it because implicit output.

### Length 2

n1


Same as the previous snippet, but give 1 for the argument 0.

Oasis programs can have a list of hardcoded definitions for special cases.

So n1 can be described in pseudocode as:

A(n) := n
A(0) := 1


Special cases and indexes are reversed, so to make

A(0) := 1
A(1) := 4


The correct special cases definition is 41

As @Adnan pointed it out, another interesting snippet is the fibonnaci sequence:

+T


Because T is replaced with 10, so this is expanded to

+10


Which mean

A(n) = A(n - 1) + A(n - 2)
A(0) = 0
A(1) = 1


### Length 3

n*1


Finally, an useful snippet!

This calculate a factorial.

     A(n) = n * A(n - 1)
n    Push n
*   Multiply two items on the stack
Because there is only one item on the stack, A(n-1) is pushed
1  A(0) = 1


### Length 4

n*x1


Showcase the command x (Double a number).

This is basically a factorial, but double the number returned by n*A(n-1).

A(n) = n * A(n - 1) * 2
A(0) = 1


### Length 5

Tnm>1


Calculate A000533

       A(n) = 10^n + 1
T      Push 10
n     Push n
m    Power
>   Increment
1  A(0) = 1


## Oasis

### Factoid

Oasis is a language made by Adnan specialized in number sequences.

You can try it online here.

### Length 1

n


Not very interesting, just push n (The current argument) and print it because implicit output.

### Length 2

n1


Same as the previous snippet, but give 1 for the argument 0.

Oasis programs can have a list of hardcoded definitions for special cases.

So n1 can be described in pseudocode as:

A(n) = n
A(0) = 1


Special cases and indexes are reversed, so to make

A(0) = 1
A(1) = 4


The correct special cases definition is 41

As @Adnan pointed it out, another interesting snippet is the fibonnaci sequence:

+T


Because T is replaced with 10, so this is expanded to

+10


Which mean

A(n) = A(n - 1) + A(n - 2)
A(0) = 0
A(1) = 1


### Length 3

n*1


Finally, an useful snippet!

This calculate a factorial.

     A(n) = n * A(n - 1)
n    Push n
*   Multiply two items on the stack
Because there is only one item on the stack, A(n-1) is pushed
1  A(0) = 1


### Length 4

n*x1


Showcase the command x (Double a number).

This is basically a factorial, but double the number returned by n*A(n-1).

A(n) = n * A(n - 1) * 2
A(0) = 1


### Length 5

Tnm>1


Calculate A000533

       A(n) = 10^n + 1
T      Push 10
n     Push n
m    Power
>   Increment
1  A(0) = 1

7 added 450 characters in body

## Oasis

### Factoid

Oasis is a language made by Adnan specialized in number sequences.

You can try it online here.

### Length 1

n


Not very interesting, just push n (The current argument) and print it because implicit output.

### Length 2

n1


Same as the previous snippet, but give 1 for the argument 0.

Oasis programs can have a list of hardcoded definitions for special cases.

So n1 can be described in pseudocode as:

A(n) := n
A(0) := 1


Special cases and indexes are reversed, so to make

A(0) := 1
A(1) := 4


The correct special cases definition is 41

As @Adnan pointed it out, another interesting snippet is the fibonnaci sequence:

+T


Because T is replaced with 10, so this is expanded to

+10


Which mean

A(n) = A(n - 1) + A(n - 2)
A(0) = 0
A(1) = 1


### Length 3

n*1


Finally, an useful snippet!

This calculate a factorial.

     A(n) = n * A(n - 1)
n    Push n
*   Multiply two items on the stack
Because there is only one item on the stack, A(n-1) is pushed
1  A(0) = 1


### Length 4

n*x1


Showcase the command x (Double a number).

This is basically a factorial, but double the number returned by n*A(n-1).

A(n) = n * A(n - 1) * 2
A(0) = 1


### Length 5

Tnm>1


Calculate A000533

       A(n) = 10^n + 1
T      Push 10
n     Push n
m    Power
>   Increment
1  A(0) = 1


## Oasis

### Factoid

Oasis is a language made by Adnan specialized in number sequences.

You can try it online here.

### Length 1

n


Not very interesting, just push n (The current argument) and print it because implicit output.

### Length 2

n1


Same as the previous snippet, but give 1 for the argument 0.

Oasis programs can have a list of hardcoded definitions for special cases.

So n1 can be described in pseudocode as:

A(n) := n
A(0) := 1


Special cases and indexes are reversed, so to make

A(0) := 1
A(1) := 4


The correct special cases definition is 41

### Length 3

n*1


Finally, an useful snippet!

This calculate a factorial.

     A(n) = n * A(n - 1)
n    Push n
*   Multiply two items on the stack
Because there is only one item on the stack, A(n-1) is pushed
1  A(0) = 1


### Length 4

n*x1


Showcase the command x (Double a number).

This is basically a factorial, but double the number returned by n*A(n-1).

A(n) = n * A(n - 1) * 2
A(0) = 1


## Oasis

### Factoid

Oasis is a language made by Adnan specialized in number sequences.

You can try it online here.

### Length 1

n


Not very interesting, just push n (The current argument) and print it because implicit output.

### Length 2

n1


Same as the previous snippet, but give 1 for the argument 0.

Oasis programs can have a list of hardcoded definitions for special cases.

So n1 can be described in pseudocode as:

A(n) := n
A(0) := 1


Special cases and indexes are reversed, so to make

A(0) := 1
A(1) := 4


The correct special cases definition is 41

As @Adnan pointed it out, another interesting snippet is the fibonnaci sequence:

+T


Because T is replaced with 10, so this is expanded to

+10


Which mean

A(n) = A(n - 1) + A(n - 2)
A(0) = 0
A(1) = 1


### Length 3

n*1


Finally, an useful snippet!

This calculate a factorial.

     A(n) = n * A(n - 1)
n    Push n
*   Multiply two items on the stack
Because there is only one item on the stack, A(n-1) is pushed
1  A(0) = 1


### Length 4

n*x1


Showcase the command x (Double a number).

This is basically a factorial, but double the number returned by n*A(n-1).

A(n) = n * A(n - 1) * 2
A(0) = 1


### Length 5

Tnm>1


Calculate A000533

       A(n) = 10^n + 1
T      Push 10
n     Push n
m    Power
>   Increment
1  A(0) = 1

6 added 197 characters in body
5 added 274 characters in body
4 added 384 characters in body
3 added 37 characters in body
2 added 88 characters in body
1