A018928 - cp's OEIS frontend

A018928 Define {b(n)} by b(1)=3, b(n) (n >= 2) is the 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.

n	a(n)
1	3
2	5
3	13
4	85
5	157
6	12325
7	12461
8	106285
9	276341
10	339709
11	10363909
12	17238541
13	1936511509
14	51335823965
15	133473142309
16	872709007405
17	1574530008629
18	667511933218429
19	698925273030725
20	707670964169285
21	1839944506840141

[3, 5, 13, 85, 157, 12325, 12461, 106285, 276341, 339709, 10363909, 17238541, 1936511509, 51335823965, 133473142309, 872709007405, 1574530008629, 667511933218429, 698925273030725, 707670964169285, 1839944506840141]

cp's OEIS Frontend

A018928 Define {b(n)} by b(1)=3, b(n) (n >= 2) is the 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.

Table of values

List of values