login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076971 a(1) = 1, a(n+1)= smallest triangular number greater than the n-th partial sum. 1

%I #6 Dec 05 2013 19:55:48

%S 1,3,6,15,28,55,120,231,465,946,1891,3828,7626,15225,30628,61075,

%T 122265,244650,489555,979300,1959210,3918600,7838820,15677200,

%U 31359240,62714400,125429041,250868800,501732003,1003497600,2006959690

%N a(1) = 1, a(n+1)= smallest triangular number greater than the n-th partial sum.

%p a[1] := 1:a[2] := 3:for n from 3 to 145 do a[n] := sum(a[i],i=1..n-1); a[n] := ceil(evalf(-1/2+1/2*sqrt(1+8*a[n])+10^(-19),100)):a[n] := a[n]*(a[n]+1)/2: od:seq(a[k],k=1..145);

%Y Cf. A076972.

%K nonn

%O 1,2

%A _Amarnath Murthy_, Oct 21 2002

%E More terms from _Sascha Kurz_, Jan 22 2003

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)