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.

A366601 a(0) = 0. For a(n-1) a novel term a(n) = a(A025480(a(n-1))), and if a(n-1) has occurred k (>1) times, a(n) = k-1 (the number of repetitions of a(n-1) in all prior terms).

Table of values

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

List of values

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