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.

A345147 a(1)=1. If a(n) is a novel term, a(n+1) = A000005(a(n)). If a(n) is a repeat term, a(n+1) = a(n)+m, where m is the least prior term (which once used in this way is not used again).

Table of values

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

List of values

[1, 1, 2, 2, 3, 2, 4, 3, 5, 2, 4, 6, 4, 7, 2, 5, 7, 11, 2, 6, 8, 4, 8, 12, 6, 11, 16, 5, 11, 16, 22, 4, 10, 4, 8, 12, 19, 2, 9, 3, 5, 8, 13, 2, 10, 12, 20, 6, 14, 4, 10, 14, 22, 31, 2, 12, 14, 24, 8, 18, 6, 14, 20, 31, 42, 8, 19, 27, 4, 16, 20, 32, 6, 18, 24, 36]