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.

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

Table of values

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

List of values

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

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

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