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.

A026272 a(n) = smallest k such that k=a(n-k-1) is the only appearance of k so far; if there is no such k, then a(n) = least positive integer that has not yet appeared.

Table of values

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

List of values

[1, 2, 1, 3, 2, 4, 5, 3, 6, 7, 4, 8, 5, 9, 10, 6, 11, 7, 12, 13, 8, 14, 15, 9, 16, 10, 17, 18, 11, 19, 20, 12, 21, 13, 22, 23, 14, 24, 15, 25, 26, 16, 27, 28, 17, 29, 18, 30, 31, 19, 32, 20, 33, 34, 21, 35, 36, 22, 37, 23, 38, 39, 24, 40, 41, 25]