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.

A376194 a(n) = smallest number missing from A375564 after A375564(n) has been found.

Original entry on oeis.org

2, 3, 4, 5, 5, 5, 5, 7, 9, 11, 11, 11, 11, 11, 11, 11, 11, 13, 17, 19, 21, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 29, 31, 37, 41, 43, 45, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 53, 59, 61, 67, 71, 73, 79, 83, 85, 89
Offset: 1

Views

Author

N. J. A. Sloane, Sep 26 2024

Keywords

Examples

			A375564 begins 1, 2, 3, 4, 6, 8, 10, 5, 7, 9, 12, ... so the successive smallest missing numbers are 2, 3, 4, 5, 5, 5, 7, 9, 11, 11, 11, ...
		

Crossrefs

Cf. A375564.