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.

Original entry on oeis.org

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
Offset: 1

Views

Author

N. J. A. Sloane, Jul 24 2019

Keywords

Examples

			After we reach A111273(8) = 6, the smallest missing number in A111273 is 8 (see A309195). We do not see 8 in A111273 until we reach A111273(15) = 8, so 15 is a term.
		

Crossrefs

Programs

  • PARI
    See Links section.