A188052 Stanley Sequence S(0,7).

0, 7, 8, 10, 11, 17, 18, 21, 30, 33, 37, 38, 40, 51, 54, 61, 77, 79, 83, 86, 88, 96, 110, 119, 123, 130, 153, 157, 170, 173, 178, 179, 194, 197, 207, 211, 214, 219, 232, 240, 247, 251, 256, 282, 290, 344, 362, 365, 399, 409, 439, 444, 452, 455, 467, 488, 493, 496, 500, 506, 514, 520, 538, 541, 549, 555, 574, 575, 581, 597

Offset

1,2

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 4.

Crossrefs

Cf. A185256.

Sequence in context: A333490 A256651 A093678 * A266727 A214004 A037263

Adjacent sequences: A188049 A188050 A188051 * A188053 A188054 A188055

Keyword

nonn

Author

N. J. A. Sloane, Mar 19 2011

Status

approved