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.

A102828 "True already", base 2, start 1: a(n) is the least integer such that the sequence up to a(n-1) written in base 2 contains floor(a(n)/2) copies of the digit a(n) % 2, with a(0) = 1.

Table of values

n a(n)
0 1
1 3
2 7
3 13
4 19
5 25
6 31
7 41
8 47
9 57
10 65
11 69
12 75
13 83
14 91
15 101
16 109
17 119
18 131
19 137
20 143
21 153
22 161
23 167
24 177
25 185
26 195
27 203
28 213
29 223
30 237
31 249
32 261
33 267
34 275
35 283
36 293
37 301
38 311
39 323
40 331
41 341
42 351
43 365
44 377
45 389
46 397
47 407
48 419
49 429
50 441
51 453
52 463
53 477
54 491

List of values

[1, 3, 7, 13, 19, 25, 31, 41, 47, 57, 65, 69, 75, 83, 91, 101, 109, 119, 131, 137, 143, 153, 161, 167, 177, 185, 195, 203, 213, 223, 237, 249, 261, 267, 275, 283, 293, 301, 311, 323, 331, 341, 351, 365, 377, 389, 397, 407, 419, 429, 441, 453, 463, 477, 491]