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.

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

List of values

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

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

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