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.

A248893 a(0)=0; for n>0, choose a(n) to be the smallest number > a(n-1) such that the condition a(n) > Sum_{k=0..n} (number of 1's in binary expansion of n a(k)) holds.

Table of values

n a(n)
0 0
1 2
2 4
3 5
4 8
5 9
6 10
7 12
8 16
9 17
10 18
11 20
12 22
13 24
14 28
15 32
16 33
17 34
18 35
19 38
20 40
21 44
22 48
23 49
24 52
25 56
26 58
27 64
28 65
29 66
30 67
31 68
32 72
33 73
34 76
35 80
36 81
37 84
38 88
39 92
40 96
41 97
42 100
43 104
44 106
45 112
46 113
47 118
48 124
49 128
50 129
51 130
52 131
53 134
54 136
55 140
56 144
57 145
58 148
59 152
60 154
61 160

List of values

[0, 2, 4, 5, 8, 9, 10, 12, 16, 17, 18, 20, 22, 24, 28, 32, 33, 34, 35, 38, 40, 44, 48, 49, 52, 56, 58, 64, 65, 66, 67, 68, 72, 73, 76, 80, 81, 84, 88, 92, 96, 97, 100, 104, 106, 112, 113, 118, 124, 128, 129, 130, 131, 134, 136, 140, 144, 145, 148, 152, 154, 160]