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.

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

Table of values

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

List of values

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

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

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