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.

A117821 a(0) = a(1) = 1; for n >= 2, a(n) = a(n-1) + a(n-2) - n if that number is positive and not already in the sequence, otherwise a(n) = a(n-1) + a(n-2) + n.

Table of values

n a(n)
0 1
1 1
2 4
3 2
4 10
5 7
6 11
7 25
8 28
9 44
10 62
11 95
12 145
13 227
14 358
15 570
16 912
17 1465
18 2359
19 3805
20 6144
21 9928
22 16050
23 25955
24 41981
25 67911
26 109866
27 177750
28 287588
29 465309
30 752867
31 1218145
32 1970980
33 3189092
34 5160038
35 8349095
36 13509097
37 21858155
38 35367214

List of values

[1, 1, 4, 2, 10, 7, 11, 25, 28, 44, 62, 95, 145, 227, 358, 570, 912, 1465, 2359, 3805, 6144, 9928, 16050, 25955, 41981, 67911, 109866, 177750, 287588, 465309, 752867, 1218145, 1970980, 3189092, 5160038, 8349095, 13509097, 21858155, 35367214]