|
%I #14 Apr 20 2023 11:06:34
%S 0,7,8,10,11,17,18,21,30,33,37,38,40,51,54,61,77,79,83,86,88,96,110,
%T 119,123,130,153,157,170,173,178,179,194,197,207,211,214,219,232,240,
%U 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
%N Stanley Sequence S(0,7).
%C See A185256.
%H Alois P. Heinz, <a href="/A188052/b188052.txt">Table of n, a(n) for n = 1..2000</a>
%H P. Erdos, V. Lev, G. Rauzy, C. Sandor, and A. Sarkozy, <a href="https://doi.org/10.1016/S0012-365X(98)00385-9">Greedy algorithm, arithmetic progressions, subset sums and divisibility</a>, Discrete Mathematics 200 (1999), pp. 119-135. See Table 4.
%Y Cf. A185256.
%K nonn
%O 1,2
%A _N. J. A. Sloane_, Mar 19 2011
|
