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.

A085246 Satisfies a(1)=1, a(A026835(n+1)) = a(n)+1, with a(m)=0 for all m not found in A026835, where A026835(n+2)=A026835(n+1)+a(n)+1.

Table of values

n a(n)
1 1
2 2
3 0
4 3
5 0
6 0
7 1
8 4
9 0
10 0
11 0
12 1
13 1
14 2
15 0
16 5
17 0
18 0
19 0
20 0
21 1
22 1
23 1
24 2
25 0
26 2
27 0
28 3
29 0
30 0
31 1
32 6
33 0
34 0
35 0
36 0
37 0
38 1
39 1
40 1
41 1
42 2
43 0
44 2
45 0
46 2
47 0
48 3
49 0
50 0
51 1
52 3
53 0
54 0
55 1
56 4
57 0
58 0
59 0
60 1
61 1
62 2
63 0
64 7
65 0
66 0
67 0
68 0
69 0
70 0
71 1
72 1
73 1
74 1
75 1
76 2
77 0
78 2
79 0
80 2
81 0
82 2
83 0
84 3
85 0
86 0
87 1
88 3
89 0
90 0
91 1
92 3
93 0
94 0
95 1
96 4
97 0
98 0
99 0
100 1
101 1
102 2
103 0
104 4
105 0

List of values

[1, 2, 0, 3, 0, 0, 1, 4, 0, 0, 0, 1, 1, 2, 0, 5, 0, 0, 0, 0, 1, 1, 1, 2, 0, 2, 0, 3, 0, 0, 1, 6, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 0, 2, 0, 2, 0, 3, 0, 0, 1, 3, 0, 0, 1, 4, 0, 0, 0, 1, 1, 2, 0, 7, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 0, 2, 0, 2, 0, 2, 0, 3, 0, 0, 1, 3, 0, 0, 1, 3, 0, 0, 1, 4, 0, 0, 0, 1, 1, 2, 0, 4, 0]