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.

A329221 a(0)=0. If a(n)=k is the first occurrence of k then a(n+1)=a(k), otherwise a(n+1)=n-m where m is the index of the greatest prior term.

Table of values

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

List of values

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