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.

A226077 a(1)=1; a(n) = smallest positive integer not yet in the sequence, such that a(n) and a(n-1) have exactly one common 1-bit in their binary representations.

Table of values

n a(n)
1 1
2 3
3 2
4 6
5 4
6 5
7 9
8 7
9 10
10 8
11 11
12 12
13 20
14 13
15 17
16 15
17 18
18 14
19 19
20 16
21 21
22 24
23 22
24 25
25 33
26 23
27 34
28 26
29 35
30 29
31 36
32 28
33 37
34 27
35 38
36 32
37 39
38 40
39 30
40 41
41 48
42 31
43 65
44 43
45 52
46 42
47 49
48 44
49 50
50 45
51 67
52 46
53 66
54 47
55 68
56 53
57 70
58 51
59 69
60 54
61 74
62 55
63 73
64 56
65 72
66 57
67 71
68 58
69 76
70 59
71 80
72 60
73 75
74 64
75 77
76 82
77 61
78 96
79 62
80 81
81 78
82 97
83 84
84 98
85 85
86 104
87 83
88 100
89 88

List of values

[1, 3, 2, 6, 4, 5, 9, 7, 10, 8, 11, 12, 20, 13, 17, 15, 18, 14, 19, 16, 21, 24, 22, 25, 33, 23, 34, 26, 35, 29, 36, 28, 37, 27, 38, 32, 39, 40, 30, 41, 48, 31, 65, 43, 52, 42, 49, 44, 50, 45, 67, 46, 66, 47, 68, 53, 70, 51, 69, 54, 74, 55, 73, 56, 72, 57, 71, 58, 76, 59, 80, 60, 75, 64, 77, 82, 61, 96, 62, 81, 78, 97, 84, 98, 85, 104, 83, 100, 88]