|
%I #23 Oct 14 2018 21:50:58
%S 1,4,9,15,22,30,40,51,63,76,90,106,123,141,160,180,201,224,248,273,
%T 299,326,354,383,414,446,479,513,548,584,621,659,698,739,781,824,868,
%U 913,959,1006,1054,1103,1153,1205,1258,1312,1367,1423,1480,1538,1597,1657,1718
%N Sequence and first differences include all positive integers except 2.
%C a(n) = a(n-1) + c(n) for n >= 2, a( ) increasing, given a(1) = 1; where c( ) is complement of a( ). - _Clark Kimberling_
%H Ivan Neretin, <a href="/A022443/b022443.txt">Table of n, a(n) for n = 1..10000</a>
%H G. S. Kazandzidis, <a href="http://gdz.sub.uni-goettingen.de/dms/load/img/?PID=GDZPPN002290766">A General Formula for Some Number-Sequences</a>, Math. Annalen, 147 (1962), 367-372.
%t Fold[Append[#1, #1[[-1]] + Complement[Range[Max@#1 + 3], #1][[#2]]] &, {1, 4}, Range[3, 50]] (* _Ivan Neretin_, Apr 05 2016 *)
%Y Cf. A005228 and references therein.
%K nonn
%O 1,2
%A _N. J. A. Sloane_
|
