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.

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

List of values

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

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

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