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.

A385996 a(n) is the least k such that some value appears n times among A002487(0), ..., A002487(k).

Original entry on oeis.org

0, 2, 4, 8, 16, 28, 34, 44, 52, 62, 68, 88, 104, 124, 130, 152, 184, 200, 232, 250, 260, 296, 328, 380, 388, 440, 472, 500, 524, 568, 632, 688, 764, 772, 848, 904, 968, 1012, 1030, 1064, 1144, 1232, 1288, 1424, 1534, 1538, 1648, 1784, 1840, 1928, 2008, 2038
Offset: 1

Views

Author

Rémy Sigrist, Jul 14 2025

Keywords

Crossrefs

See A385995 for the corresponding values.

Formula

A091948(a(n)) = n (this is the first occurrence of n in A091948).