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.

A026409 For n >= 1, n n's take places at stage n: the first takes the least untaken place (l.u.p) and for 2<=k<=n, the k-th n takes the l.u.p. more than n-1 places past the place of the (k-1)st n.

Table of values

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

List of values

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