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.

A281354 a(n) = smallest missing number after A280985(n) has been computed.

Original entry on oeis.org

2, 3, 3, 5, 5, 7, 7, 8, 8, 9, 11, 11, 13, 13, 15, 15, 16, 16, 17, 19, 19, 20, 20, 21, 23, 23, 25, 25, 27, 27, 28, 29, 29, 31, 31, 33, 33, 35, 35, 37, 37, 39, 39, 41, 41, 43, 43, 44, 44, 45, 47, 47, 49, 49, 50, 50, 51, 52, 52, 53, 55, 55, 57, 57, 59, 61, 61, 63, 63, 64, 64, 65, 67, 67, 68, 68, 69, 71, 71
Offset: 1

Views

Author

N. J. A. Sloane, Jan 21 2017

Keywords

Comments

Since A280985 and A127202 agree for the first 719 terms, for n < 719 this is also the smallest missing number after A127202(n) has been computed.

Crossrefs