A018929 - cp's OEIS frontend

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.

n	a(n)
1	9
2	25
3	169
4	7225
5	24649
6	151905625
7	155276521
8	11296501225
9	76364348281
10	115402204681
11	107410609760281
12	297167295808681
13	3750076824489457081
14	2635366822165468321225
15	17815079717838565851481
16	761621011605820344834025

[9, 25, 169, 7225, 24649, 151905625, 155276521, 11296501225, 76364348281, 115402204681, 107410609760281, 297167295808681, 3750076824489457081, 2635366822165468321225, 17815079717838565851481, 761621011605820344834025]

cp's OEIS Frontend

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.

Table of values

List of values