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.

A075311 a(1) = 1; for n > 1, a(n) is the smallest number m > a(n-1) such that the number of 1's in the binary expansion of m is not already in the sequence.

Table of values

n a(n)
1 1
2 3
3 5
4 6
5 9
6 10
7 12
8 15
9 17
10 18
11 20
12 23
13 24
14 27
15 29
16 30
17 33
18 34
19 36
20 39
21 40
22 43
23 45
24 46
25 48
26 51
27 53
28 54
29 57
30 58
31 60
32 65
33 66
34 68
35 71
36 72
37 75
38 77
39 78
40 80
41 83
42 85
43 86
44 89
45 90
46 92
47 96
48 99
49 101
50 102
51 105
52 106
53 108
54 113
55 114
56 116
57 120
58 127
59 129
60 130
61 132
62 135
63 136
64 139
65 141

List of values

[1, 3, 5, 6, 9, 10, 12, 15, 17, 18, 20, 23, 24, 27, 29, 30, 33, 34, 36, 39, 40, 43, 45, 46, 48, 51, 53, 54, 57, 58, 60, 65, 66, 68, 71, 72, 75, 77, 78, 80, 83, 85, 86, 89, 90, 92, 96, 99, 101, 102, 105, 106, 108, 113, 114, 116, 120, 127, 129, 130, 132, 135, 136, 139, 141]