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.

A383876 a(0) = 0, a(1) = 1. Let n be greatest index such that a(0),...a(n) are already known. If a(n) is not a record term, a(n+1) = number of k < n such that a(k) = a(n). If a(n) is a record term a(n+1) = a(r) where r is the greatest record < a(n).

Table of values

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

List of values

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