Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A018929
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A018929 Define {b(n)} by b(1)=3, b(n) (n >= 2) is smallest number such that b(1)^2+...+b(n)^2 = m^2 for some m and all b(i) are distinct. Sequence gives values of m^2. +0
3
9, 25, 169, 7225, 24649, 151905625, 155276521, 11296501225, 76364348281, 115402204681, 107410609760281, 297167295808681, 3750076824489457081, 2635366822165468321225, 17815079717838565851481, 761621011605820344834025 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Cf. A018928, A018930.

Sequence in context: A098773 A089998 A014728 this_sequence A051515 A053929 A014760

Adjacent sequences: A018926 A018927 A018928 this_sequence A018930 A018931 A018932

KEYWORD

nonn

AUTHOR

charles.reed(AT)bbs.ewgateway.org (Charles Reed)

EXTENSIONS

More terms from David W. Wilson (davidwwilson(AT)comcast.net).

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 September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research