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.

A364784 a(n) = n for n <= 2. Thereafter if a(n-1) is a novel term, a(n) = a(a(k)) where k is the greatest prior term < a(n-1); otherwise, a(n) = number of times a(n-1) has been repeated.

Table of values

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

List of values

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