cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

Original entry on oeis.org

9, 25, 169, 7225, 24649, 151905625, 155276521, 11296501225, 76364348281, 115402204681, 107410609760281, 297167295808681, 3750076824489457081, 2635366822165468321225, 17815079717838565851481, 761621011605820344834025
Offset: 1

Views

Author

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

Keywords

Crossrefs

Formula

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

Extensions

More terms from David W. Wilson