Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076967
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076967 a(1) = 1, a(n+1)= smallest square greater than the n-th partial sum. +0
2
1, 4, 9, 16, 36, 81, 169, 324, 676, 1369, 2704, 5476, 11025, 21904, 44100, 88209, 176400, 352836, 705600, 1411344, 2822400, 5645376, 11296321, 22591009, 45185284, 90364036, 180741136, 361494169, 722964544, 1445976676, 2891965729 (list; graph; listen)
OFFSET

1,2

EXAMPLE

a(5) = 36 because it is the smallest square greater than the sum of a(1)..a(4) = 30.

MAPLE

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

CROSSREFS

Cf. A076968.

Sequence in context: A117218 A018228 A138858 this_sequence A111378 A106313 A074101

Adjacent sequences: A076964 A076965 A076966 this_sequence A076968 A076969 A076970

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

Corrected and extended by 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 November 30 22:12 EST 2008. Contains 150989 sequences.


AT&T Labs Research