A188054 Stanley Sequence S(0,1,5).

0, 1, 5, 6, 8, 13, 14, 17, 19, 31, 35, 36, 40, 42, 46, 47, 60, 68, 82, 95, 97, 98, 102, 110, 111, 113, 121, 137, 139, 142, 146, 170, 233, 235, 240, 251, 254, 263, 281, 282, 285, 290, 297, 302, 303, 306, 318, 336, 342, 344, 374, 376, 393, 414, 417, 476, 487, 555, 584, 597, 614, 618, 621, 629, 633, 643, 660, 663, 685, 690

Offset: 1

Author

N. J. A. Sloane, Mar 19 2011

Keywords

• nonn

Comments

See A185256.

Links

• Alois P. Heinz, Table of n, a(n) for n = 1..2000
• P. Erdos, V. Lev, G. Rauzy, C. Sandor, and A. Sarkozy, Greedy algorithm, arithmetic progressions, subset sums and divisibility, Discrete Mathematics 200 (1999), pp. 119-135. See Table 6.

Crossrefs

Cf. A185256.