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.

A379692 a(1) = 1; a(n) is the most recently occurring value not among the last k terms where k is the number of times a(n-1) has occurred; if no such value exists, a(n) is the smallest unused positive integer.

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

List of values

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