Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076971
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076971 a(1) = 1, a(n+1)= smallest triangular number greater than the n-th partial sum. +0
2
1, 3, 6, 15, 28, 55, 120, 231, 465, 946, 1891, 3828, 7626, 15225, 30628, 61075, 122265, 244650, 489555, 979300, 1959210, 3918600, 7838820, 15677200, 31359240, 62714400, 125429041, 250868800, 501732003, 1003497600, 2006959690 (list; graph; listen)
OFFSET

1,2

MAPLE

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);

CROSSREFS

Cf. A076972.

Sequence in context: A056278 A000740 A069712 this_sequence A103529 A034953 A086737

Adjacent sequences: A076968 A076969 A076970 this_sequence A076972 A076973 A076974

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Oct 21 2002

EXTENSIONS

More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Jan 22 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research