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.

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

Table of values

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

List of values

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