|
%I #18 Apr 20 2023 11:06:07
%S 0,1,4,5,11,12,14,15,31,32,34,35,40,41,43,44,89,90,92,93,98,99,101,
%T 102,116,117,119,120,125,126,128,129,259,260,262,263,268,269,271,272,
%U 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
%N Stanley Sequence S(0,1,4).
%C See A185256.
%H Alois P. Heinz, <a href="/A188053/b188053.txt">Table of n, a(n) for n = 1..2048</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 5.
%H R. A. Moy and D. Rolnick, <a href="http://arxiv.org/abs/1502.06013">Novel structures in Stanley sequences</a>, Discrete Math., 339 (2016), 689-698. Also arXiv:1502.06013v1, 2015.
%Y Cf. A185256.
%K nonn
%O 1,3
%A _N. J. A. Sloane_, Mar 19 2011
|
