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.

A119474 a(2^m + k) = a(k)-th integer among those positive integers not occurring earlier in the sequence, where m >= 0, 1 <= k<= 2^m. a(1) = 1.

Table of values

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

List of values

[1, 2, 3, 5, 4, 7, 9, 12, 6, 10, 13, 16, 15, 20, 23, 27, 8, 14, 18, 22, 21, 28, 31, 35, 26, 34, 39, 43, 42, 49, 53, 58, 11, 19, 25, 32, 30, 38, 44, 48, 37, 47, 54, 59, 57, 65, 69, 74, 45, 60, 66, 72, 71, 81, 85, 90, 79, 91, 97, 102, 101, 110, 115, 121, 17, 29, 36, 46, 41, 55, 62]