A287965 Smallest number which can be represented as the sum of distinct squares of primes in exactly n ways, or 0 if no such integer exists.

4, 410, 1014, 1494, 1685, 2188, 2335, 2573, 2717, 2863, 3054, 3389, 3224, 3654, 3534, 4014, 4232, 4183, 4254, 4064, 4589, 4618, 4544, 4593, 4903, 5193, 5503, 5215, 5579, 5433, 5455, 5673, 5962, 5983, 6158, 6178, 5744, 5864, 5984, 5913, 6223, 6273, 6678, 6393, 6442, 6513, 6870, 6535, 7038, 7015

Offset

1,1

Links

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

Index entries for sequences related to sums of squares

Formula

A111900(a(n)) = n.

Example

a(2) = 410 because 410 = 7^2 + 19^2 = 11^2 + 17^2 and this is the smallest number that can be written as the sum of distinct squares of primes in 2 different ways.

Crossrefs

Cf. A001248, A048261, A097563, A111900, A121518.

Sequence in context: A280791 A198709 A326209 * A215647 A228242 A036771

Adjacent sequences: A287962 A287963 A287964 * A287966 A287967 A287968

Keyword

nonn

Author

Ilya Gutkovskiy, Jun 03 2017

Status

approved