cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A336604 a(0) = 1, a(1) = 2; thereafter let x = (a(n-1) mod a(n-2)); then a(n) = a(n-1) + a(x) if x < n, otherwise a(n) = a(n-1).

Table of values

n a(n)
0 1
1 2
2 3
3 5
4 8
5 13
6 26
7 27
8 29
9 32
10 37
11 50
12 50
13 51
14 53
15 56
16 61
17 74
18 125
19 125
20 126
21 128
22 131
23 136
24 149
25 200
26 200
27 201
28 203
29 206
30 211
31 224
32 275
33 275
34 276
35 278
36 281
37 286
38 299
39 350
40 350
41 351
42 353
43 356
44 361
45 374
46 425
47 425
48 426
49 428
50 431
51 436
52 449
53 500
54 936
55 936
56 937
57 939
58 942
59 947
60 960
61 1011

List of values

[1, 2, 3, 5, 8, 13, 26, 27, 29, 32, 37, 50, 50, 51, 53, 56, 61, 74, 125, 125, 126, 128, 131, 136, 149, 200, 200, 201, 203, 206, 211, 224, 275, 275, 276, 278, 281, 286, 299, 350, 350, 351, 353, 356, 361, 374, 425, 425, 426, 428, 431, 436, 449, 500, 936, 936, 937, 939, 942, 947, 960, 1011]