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.

A262374 a(1) = 1; for n > 1, let s denote the binary representation of a(n-1) with the first bit omitted. Then a(n) is the smallest number not yet present whose binary representation starts with s, omitting leading zeros.

Table of values

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

List of values

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