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.

A026276 a(n) = a(m) if a(m) has already occurred exactly once and n = a(m) + m + 2, else a(n) = least positive integer that has not yet occurred.

Table of values

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

List of values

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.