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.

A300082 a(1) = 1, a(n) = the smallest integer > a(n-1) such that Sum_{k=1..n} a(k) written in binary contains binary n as a substring.

Table of values

n a(n)
1 1
2 3
3 7
4 8
5 10
6 15
7 16
8 20
9 21
10 37
11 38
12 40
13 53
14 65
15 80
16 82
17 84
18 96
19 111
20 129
21 150
22 172
23 193
24 201
25 202
26 203
27 227
28 228
29 254
30 258
31 259
32 289
33 296
34 316
35 317
36 327
37 349
38 371
39 399
40 425
41 426
42 432
43 449
44 453
45 509
46 513
47 526
48 548
49 593
50 594
51 611
52 642
53 643
54 644
55 648
56 649

List of values

[1, 3, 7, 8, 10, 15, 16, 20, 21, 37, 38, 40, 53, 65, 80, 82, 84, 96, 111, 129, 150, 172, 193, 201, 202, 203, 227, 228, 254, 258, 259, 289, 296, 316, 317, 327, 349, 371, 399, 425, 426, 432, 449, 453, 509, 513, 526, 548, 593, 594, 611, 642, 643, 644, 648, 649]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.