|
%I #14 Apr 20 2023 11:05:53
%S 0,1,5,6,8,13,14,17,19,31,35,36,40,42,46,47,60,68,82,95,97,98,102,110,
%T 111,113,121,137,139,142,146,170,233,235,240,251,254,263,281,282,285,
%U 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
%N Stanley Sequence S(0,1,5).
%C See A185256.
%H Alois P. Heinz, <a href="/A188054/b188054.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 6.
%Y Cf. A185256.
%K nonn
%O 1,3
%A _N. J. A. Sloane_, Mar 19 2011
|
