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.

A352964 a(0) = 0, a(1) = 1, and for any n > 1, a(n) = a(n-F(e)) + a(n-F(e+1)) with e as large as possible (where F(k) is the k-th Fibonacci number).

Table of values

n a(n)
0 0
1 1
2 1
3 1
4 2
5 1
6 2
7 3
8 1
9 3
10 2
11 3
12 5
13 1
14 3
15 4
16 2
17 5
18 3
19 5
20 8
21 1
22 4
23 3
24 4
25 7
26 2
27 5
28 7
29 3
30 8
31 5
32 8
33 13
34 1
35 4
36 5
37 3
38 7
39 4
40 7
41 11
42 2
43 7
44 5
45 7
46 12
47 3
48 8
49 11
50 5
51 13
52 8
53 13
54 21
55 1
56 5
57 4
58 5
59 9
60 3
61 7
62 10
63 4
64 11
65 7
66 11
67 18
68 2
69 7
70 9
71 5
72 12
73 7
74 12
75 19
76 3
77 11
78 8
79 11
80 19

List of values

[0, 1, 1, 1, 2, 1, 2, 3, 1, 3, 2, 3, 5, 1, 3, 4, 2, 5, 3, 5, 8, 1, 4, 3, 4, 7, 2, 5, 7, 3, 8, 5, 8, 13, 1, 4, 5, 3, 7, 4, 7, 11, 2, 7, 5, 7, 12, 3, 8, 11, 5, 13, 8, 13, 21, 1, 5, 4, 5, 9, 3, 7, 10, 4, 11, 7, 11, 18, 2, 7, 9, 5, 12, 7, 12, 19, 3, 11, 8, 11, 19]