forked from Adriandmen/Oasis
-
Notifications
You must be signed in to change notification settings - Fork 0
/
info.txt
225 lines (222 loc) · 4 KB
/
info.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
! = Factorial (A 1)
" =
# = Pop x, get last of x
$ = Pop x, get first of x
% = Modulo of two numbers (A 2)
& =
' =
( =
) =
* = Multiplies two numbers (A 2)
+ = Adds two numbers (A 2)
, =
- = Subtracts two numbers (A 2)
. =
/ = Divides two numbers (A 2)
0 = Numeric literal (A 0)
1 = Numeric literal (A 0)
2 = Numeric literal (A 0)
3 = Numeric literal (A 0)
4 = Numeric literal (A 0)
5 = Numeric literal (A 0)
6 = Numeric literal (A 0)
7 = Numeric literal (A 0)
8 = Numeric literal (A 0)
9 = Numeric literal (A 0)
: =
; =
< = Decrements a number (A 1)
= =
> = Increments a number (A 1)
? =
@ =
A = Truthify, 1 becomes 1 and the rest becomes 0 (A 1)
B =
C =
D = Pops A, B and checks if B divides A (A 2)
E = Convert a number from decimal to binary (A 1)
F = Pops x, pushes prime factors with duplicates of x
G =
H =
I =
J =
K =
L = Create the list [1 .. A] (A 1)
M =
N = Constant: None (A 0)
O =
P = Computes the product of a list (A 1)
Q = Pops A and B and checks if they are equal (A 2)
R = Inclusive range [A .. B]
S = Computes the sum of a list (A 1)
T = Replaced in the code by "10"
U = Replaced in the code by "00"
V = Replaced in the code by "11"
W = Replaced in the code by "000"
X = Replaced in the code by "01"
Y =
Z =
[ =
\ =
] =
^ =
_ = Negate, 0 becomes 1 and everything else becomes 0 (A 1)
` =
a = Pops x and pushes a(x) (A 1)
b = Pushes a(n - 1) (A 0)
c = Pushes a(n - 2) (A 0)
d = Pushes a(n - 3) (A 0)
e = Pops x, pushes a(n - x) (A 1)
f = Pops x, pushes prime factors of x
g =
h =
i =
j = Get the largest divisor < n (A 1)
k = Squares a number (A 1)
l = Length (A 1)
m = Power function, pushes a ** b (A 2)
n = Pushes n to the stack (A 0)
o = Pops x, pushes 2 ** x (A 1)
p = Checks if a number is prime (A 1)
q = A000040, prime(n) (A 1)
r =
s = Pop A, B and push B, A (A 2)
t = Halves a number (A 1)
u = Divides a number by three (A 1)
v = Integer halves a number (A 1)
w = Integer divides a number by three (A 1)
x = Doubles a number (A 1)
y = Triples a number (A 1)
z = Quadruples a number (A 1)
{ = Pops A, pushes sorted A (A 1)
| =
} =
~ =
€ =
‚ =
ƒ =
„ =
… =
† =
‡ =
ˆ =
‰ =
Š =
‹ =
Œ =
Ž =
‘ =
’ =
“ =
” =
• =
– =
— =
˜ =
™ =
š =
› =
œ =
ž =
Ÿ =
¡ =
¢ =
£ =
¤ =
¥ = Pops A and pushes the delta's of A (A 1)
¦ =
§ =
¨ =
© =
ª =
« = Decrements a number twice (A 1)
¬ =
® =
¯ =
° =
± =
² = Push the second number argument
³ = Push the third number argument
´ =
µ =
¶ =
· =
¸ =
¹ = Push the first number argument
º =
» = Increments a number twice (A 1)
¼ =
½ =
¾ =
¿ =
À =
Á =
 =
à =
Ä =
Å =
Æ =
Ç =
È =
É =
Ê =
Ë =
Ì =
Í =
Î =
Ï =
Ð =
Ñ =
Ò =
Ó =
Ô =
Õ =
Ö =
× =
Ø =
Ù =
Ú =
Û =
Ü =
Ý =
Þ = Used for negative basecase (base 214 convert)
ß = Used for multidigit basecases (base 214 convert)
à = Push a(n - 1) and a(n - 2)
á = Push a(n - 2) and a(n - 1)
â =
ã =
ä =
å =
æ =
ç =
è =
é =
ê =
ë =
ì =
í =
î =
ï =
ð =
ñ =
ò =
ó =
ô =
õ =
ö =
÷ = Integer divides two numbers (A 2)
ø =
ù =
ú =
û =
ü =
ý =
þ =
ÿ =
Arguments:
-n = Find the first number after n satisfying each line of code
-N = Get the nth number that satisfies each line of code
-R = Reverse search the given sequence and output n where a(n) = arg[0]
-o = Add 1 to the input before calculating the function
-O = Subtract 1 from the input before calculating the function
-T = Checks if each condition is satisfied