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

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,2

Links

Rémy Sigrist, Table of n, a(n) for n = 1..10000

Rémy Sigrist, C++ program

Index entries for sequences related to Stern's sequences

Formula

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

Prog

(C++) // See Links section.

Crossrefs

See A385995 for the corresponding values.

Cf. A002487, A091948.

Sequence in context: A395803 A104899 A057975 * A260881 A089055 A305122

Adjacent sequences: A385993 A385994 A385995 * A385997 A385998 A385999

Keyword

nonn

Author

Rémy Sigrist, Jul 14 2025

Status

approved