Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #8 Sep 16 2015 04:39:31
%S 0,1,3,5,11,17,29,48,75,111,157,203,261,332,417,517,633,749,883,1036,
%T 1209,1403,1619,1858,2121,2409,2723,3064,3433,3802,4201,4631,5093,
%U 5588,6117,6681,7281,7918,8593,9307,10061,10856,11693,12573,13497
%N a(0)=0. a(n) = a(n-1) + sum of positive integers which are <= n and not part of the sequence.
%e The positive integers which are <= 7 and are missing from the terms a(0) through a(6) are 2,4,6,7. So a(7) = a(6) + 2+4+6+7 = 48.
%t a = {0}; For[n = 1, n < 60, n++, co = 0; For[i = 0, i <n + 1, i++, If[Length[ Intersection[{i}, a]] == 0, co = co + i]]; AppendTo[a, a[[ -1]] + co]]; a (* _Stefan Steinerberger_, Jun 05 2007 *)
%K nonn
%O 0,3
%A _Leroy Quet_, Jun 01 2007
%E More terms from _Stefan Steinerberger_, Jun 05 2007