A018929 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

Table of n, a(n) for n=1..16.

FORMULA

a(n) = A018928(n+1)^2 - A018930(n+1)^2. - César Aguilera, Nov 02 2018

CROSSREFS

Cf. A018928, A018930.

Sequence in context: A014728 A372382 A223646 * A051515 A328714 A337344

Adjacent sequences: A018926 A018927 A018928 * A018930 A018931 A018932

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

More terms from David W. Wilson

STATUS

approved