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.

A328294 Set a(1)=1 and a(2)=2. For n > 2, if a(n) had already appeared in the sequence, then a(n+1) = number of steps since its most recent appearance, as in Van Eck's sequence A181391. If a(n) had not appeared before, search instead for a(n)-1, then a(n)-2, etc., until you find a number that has appeared before.

Table of values

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

List of values

[1, 2, 1, 2, 2, 1, 3, 2, 3, 2, 2, 1, 6, 4, 5, 1, 4, 3, 9, 6, 7, 1, 6, 3, 6, 2, 15, 8, 7, 8, 2, 5, 17, 6, 9, 16, 9, 2, 7, 10, 3, 17, 9, 6, 10, 5, 14, 2, 10, 4, 33, 9, 9, 1, 32, 13, 7, 18, 16, 23, 2, 13, 6, 19, 6, 2, 5, 21, 4, 19, 6, 6, 1, 19, 4, 6, 4, 2, 12, 30]