A129299 - OEIS

%I #15 Feb 03 2019 06:49:56

%S 1,2,5,8,16,24,32,48,64,80,96,112,128,144,160,192,224,256,288,320,352,

%T 384,416,472,528,584,640,696,752,808,864,952,1040,1128,1216,1304,1392,

%U 1480,1568,1656,1744,1832,1920,2008,2096,2184,2272,2408,2544,2680,2816

%N a(1)=1, a(n) = a(n-1) + (sum of the earlier terms of the sequence which are <= n).

%H Reinhard Zumkeller, <a href="/A129299/b129299.txt">Table of n, a(n) for n = 1..10000</a>

%e The terms that are <= 9 are a(1) through a(4). So a(9) = a(8) + a(1) + a(2) + a(3) + a(4) = 48 + 1 + 2 + 5 + 8 = 64.

%p a[1]:=1: for n from 2 to 60 do b:=a[n-1]: for j from 1 to n-1 do if a[j]<=n then b:=b+a[j] else b:=b: fi: od: a[n]:=b: od: seq(a[n],n=1..60); # _Emeric Deutsch_, Apr 10 2007

%o (Haskell)

%o a129299 n = a129299_list !! (n-1)

%o a129299_list = 1 : f [1] 2 where

%o    f xs@(x:_) k = y : f (y:xs) (k+1) where

%o      y = x + sum [z | z <- xs, z <= k]

%o -- _Reinhard Zumkeller_, Feb 09 2012

%Y Cf. A129300, A126022, A095114.

%K nonn

%O 1,2

%A _Leroy Quet_, Apr 08 2007

%E More terms from _Emeric Deutsch_, Apr 10 2007