Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A127689
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A127689 a(1)=3; for n>1, a(n) is least number such that a(1)^2+...+a(n)^2 is a square. +0
2
3, 4, 12, 84, 132, 12324, 15960, 26280, 27300, 66660, 115188 (list; graph; listen)
OFFSET

1,1

EXAMPLE

a(2)=4 because 3^2+4^2=5^2, a(3)=12 because 3^2+4^2+12^2=13^2 etc.

MATHEMATICA

a = {3}; For[k = 1 + a[[Length[a]]], Length[a] < 11, While[ ! IntegerQ[Sqrt[(k)^2 + Sum[(a[[t]])^2, {t, 1, Length[a]}]]], k++ ]; AppendTo[a, k]]; a

CROSSREFS

Cf. A018930, A127690, A127691.

Sequence in context: A122903 A059792 A018930 this_sequence A127690 A092417 A071543

Adjacent sequences: A127686 A127687 A127688 this_sequence A127690 A127691 A127692

KEYWORD

nonn

AUTHOR

Artur Jasinski (grafix(AT)csl.pl), Jan 23 2007

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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research