%I #19 Apr 20 2023 11:06:42
%S 0,5,6,8,9,14,15,17,27,31,32,36,38,42,43,51,65,73,74,82,89,100,101,
%T 107,109,123,152,154,165,174,177,179,190,198,211,216,220,227,233,236,
%U 260,319,328,335,336,356,361,362,370,373,406,433,444,453,465,468,470,481,490,517,521,523,528,540,541,546,562,616,696,733
%N Stanley Sequence S(0,5).
%C See A185256.
%H Alois P. Heinz, <a href="/A187843/b187843.txt">Table of n, a(n) for n = 1..2000</a>
%H P. Erdos, V. Lev, G. Rauzy, C. Sandor, 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 3.
%Y Cf. A005836, A005487, A185256.
%K nonn
%O 1,2
%A _N. J. A. Sloane_, Mar 19 2011