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.

A064066 n-th step is to add a(n) to each previous number a(k) (excluding itself, i.e., k < n) to produce n more terms of the sequence, starting with a(0)=1, a(1)=1.

Table of values

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

List of values

[1, 1, 2, 3, 3, 4, 4, 5, 4, 4, 5, 6, 5, 5, 6, 7, 7, 5, 5, 6, 7, 7, 8, 6, 6, 7, 8, 8, 9, 9, 5, 5, 6, 7, 7, 8, 8, 9, 5, 5, 6, 7, 7, 8, 8, 9, 8, 6, 6, 7, 8, 8, 9, 9, 10, 9, 9, 7, 7, 8, 9, 9, 10, 10, 11, 10, 10, 11, 6, 6, 7, 8, 8, 9, 9, 10, 9, 9, 10, 11, 6, 6, 7, 8, 8, 9, 9, 10, 9, 9, 10, 11, 10, 7, 7, 8, 9, 9]