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.

A026370 a(n) = a(m) if a(m) has already occurred exactly once and n = a(m)+2m+1, 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 5
7 2
8 6
9 7
10 3
11 8
12 9
13 10
14 11
15 4
16 12
17 13
18 5
19 14
20 15
21 16
22 17
23 6
24 18
25 19
26 7
27 20
28 21
29 22
30 23
31 8
32 24
33 25
34 9
35 26
36 27
37 10
38 28
39 29
40 11
41 30
42 31
43 32
44 33
45 12
46 34
47 35
48 13
49 36
50 37
51 38
52 39
53 14
54 40
55 41
56 15
57 42
58 43
59 16
60 44
61 45
62 17
63 46
64 47
65 48
66 49

List of values

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