login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A129300 a(0)=1. a(n) = a(n-1) + (sum of the terms of the sequence which are <= n). 2

%I

%S 1,2,5,8,11,19,27,35,51,67,83,110,137,164,191,218,245,272,299,345,391,

%T 437,483,529,575,621,667,740,813,886,959,1032,1105,1178,1251,1359,

%U 1467,1575,1683,1791,1899,2007,2115,2223,2331,2439,2547,2655,2763,2871,2979

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

%H Reinhard Zumkeller, <a href="/A129300/b129300.txt">Table of n, a(n) for n = 0..10000</a>

%e The terms that are <= 9 are a(0) through a(3). So a(9) = a(8) + a(0)+a(1)+a(2)+a(3) = 51 + 1+2+5+8 = 67.

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

%o (Haskell)

%o a129300 n = a129300_list !! (n-1)

%o a129300_list = 1 : f [1] 1 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. A129299, A126022, A095114.

%K nonn

%O 0,2

%A _Leroy Quet_, Apr 08 2007

%E More terms from _Emeric Deutsch_, Apr 12 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified November 26 01:24 EST 2014. Contains 250017 sequences.