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.

A375079 a(n) = a(n-1) + a(n-2) + ... + a(n-k) where k = (a(n-1) mod (n-1)) + 1 for n >= 3, with a(1) = 1 and a(2) = 2.

Table of values

n a(n)
1 1
2 2
3 2
4 5
5 7
6 14
7 26
8 56
9 56
10 138
11 306
12 612
13 612
14 1224
15 3004
16 5758
17 11822
18 23476
19 45284
20 91792
21 184140
22 368224
23 735948
24 1472492
25 2944996
26 5889992
27 11411652
28 23191624
29 46290860
30 92672900
31 185346856
32 370693871
33 741375929
34 1479818680
35 2962582344
36 5925164688

List of values

[1, 2, 2, 5, 7, 14, 26, 56, 56, 138, 306, 612, 612, 1224, 3004, 5758, 11822, 23476, 45284, 91792, 184140, 368224, 735948, 1472492, 2944996, 5889992, 11411652, 23191624, 46290860, 92672900, 185346856, 370693871, 741375929, 1479818680, 2962582344, 5925164688]