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.

A309197 List of numbers k such that A111273(k) reaches the smallest missing number.

Table of values

n a(n)
1 1
2 3
3 7
4 8
5 15
6 19
7 23
8 31
9 32
10 39
11 48
12 63
13 71
14 83
15 95
16 103
17 111
18 127
19 143
20 147
21 151
22 159
23 167
24 175
25 195
26 199
27 207
28 211
29 215
30 223
31 224
32 255
33 271
34 279
35 287
36 319
37 327
38 343
39 351
40 359
41 367
42 371
43 383
44 391
45 399
46 415
47 431
48 435
49 447
50 463
51 464
52 511
53 543
54 559
55 579
56 583
57 595
58 607
59 639
60 655
61 663
62 687
63 703

List of values

[1, 3, 7, 8, 15, 19, 23, 31, 32, 39, 48, 63, 71, 83, 95, 103, 111, 127, 143, 147, 151, 159, 167, 175, 195, 199, 207, 211, 215, 223, 224, 255, 271, 279, 287, 319, 327, 343, 351, 359, 367, 371, 383, 391, 399, 415, 431, 435, 447, 463, 464, 511, 543, 559, 579, 583, 595, 607, 639, 655, 663, 687, 703]

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

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