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.

A213183 Initialize a(1)=R=1. Repeat: copy the last R preceding terms to current position; increment R; do twice: append the least integer that has not appeared in the sequence yet.

Table of values

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

List of values

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