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.

A117823 a(0) = 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 0
1 1
2 3
3 7
4 6
5 8
6 20
7 21
8 33
9 45
10 68
11 102
12 158
13 247
14 391
15 623
16 998
17 1604
18 2584
19 4169
20 6733
21 10881
22 17592
23 28450
24 46018
25 74443
26 120435
27 194851
28 315258
29 510080
30 825308
31 1335357
32 2160633
33 3495957
34 5656556
35 9152478
36 14808998
37 23961439
38 38770399

List of values

[0, 1, 3, 7, 6, 8, 20, 21, 33, 45, 68, 102, 158, 247, 391, 623, 998, 1604, 2584, 4169, 6733, 10881, 17592, 28450, 46018, 74443, 120435, 194851, 315258, 510080, 825308, 1335357, 2160633, 3495957, 5656556, 9152478, 14808998, 23961439, 38770399]