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.

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

Table of values

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

List of values

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

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

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