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.

A343887 a(1) = 1. Thereafter if a(n) is a novel term, a(n+1) = number of prior terms > a(n). If a(n) has been seen already, a(n+1) = a(n) + smallest prior term (which, once used, cannot be used again).

Table of values

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

List of values

[1, 0, 1, 1, 2, 0, 1, 1, 2, 3, 0, 1, 1, 2, 3, 5, 0, 2, 2, 4, 1, 3, 4, 6, 0, 3, 3, 6, 9, 0, 3, 3, 6, 9, 12, 0, 4, 4, 8, 3, 7, 4, 7, 11, 1, 5, 6, 11, 16, 0, 6, 6, 12, 18, 0, 6, 6, 12, 18, 24, 0, 6, 6, 12, 18, 25, 0, 7, 7, 14, 6, 13, 7, 13, 20, 2, 10, 16, 18, 27, 0]