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.

A359728 a(1) = 1; a(n) is the smallest positive number not among the first k terms where k is the number of times a(n-1) has occurred.

Table of values

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

List of values

[1, 2, 2, 3, 2, 3, 3, 3, 4, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 5, 2, 4, 5, 3, 4, 5, 3, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 2, 4, 5, 6, 3, 5, 6, 3, 5, 6, 4, 5, 6, 4, 5, 6, 4, 6, 4, 6, 4, 6, 5, 6, 5, 6, 5, 6, 5, 6, 5, 6, 5, 6]