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.

A064067 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)=2.

Table of values

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

List of values

[1, 2, 3, 4, 5, 5, 6, 7, 6, 7, 8, 9, 6, 7, 8, 9, 10, 7, 8, 9, 10, 11, 11, 8, 9, 10, 11, 12, 12, 13, 7, 8, 9, 10, 11, 11, 12, 13, 8, 9, 10, 11, 12, 12, 13, 14, 13, 9, 10, 11, 12, 13, 13, 14, 15, 14, 15, 10, 11, 12, 13, 14, 14, 15, 16, 15, 16, 17, 7, 8, 9, 10, 11, 11, 12, 13, 12, 13, 14]