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!)
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. 3
9, 25, 169, 7225, 24649, 151905625, 155276521, 11296501225, 76364348281, 115402204681, 107410609760281, 297167295808681, 3750076824489457081, 2635366822165468321225, 17815079717838565851481, 761621011605820344834025 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
a(n) = A018928(n+1)^2 - A018930(n+1)^2. - César Aguilera, Nov 02 2018
CROSSREFS
Sequence in context: A089998 A014728 A223646 * A051515 A328714 A337344
KEYWORD
nonn
AUTHOR
Charles Reed (charles.reed(AT)bbs.ewgateway.org)
EXTENSIONS
More terms from David W. Wilson
STATUS
approved

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