A188053 Stanley Sequence S(0,1,4).

0, 1, 4, 5, 11, 12, 14, 15, 31, 32, 34, 35, 40, 41, 43, 44, 89, 90, 92, 93, 98, 99, 101, 102, 116, 117, 119, 120, 125, 126, 128, 129, 259, 260, 262, 263, 268, 269, 271, 272, 286, 287, 289, 290, 295, 296, 298, 299, 340, 341, 343, 344, 349, 350, 352, 353, 367, 368, 370, 371, 376, 377, 379, 380, 761, 762, 764, 765, 770, 771

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..2048
• 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 5.
• R. A. Moy and D. Rolnick, Novel structures in Stanley sequences, Discrete Math., 339 (2016), 689-698. Also arXiv:1502.06013v1, 2015.

Crossrefs

Cf. A185256.