A230779 - OEIS

Numbers with exactly one prime factor of form 4*k+1, that must have multiplicity one, and no prime factor of the form 4*k+3 with odd multiplicity. There is thus no square in the sequence.

These are the primitive elements of A004431, the integers which are the sum of two nonzero distinct squares.

Numbers such that A004018(a(n)) = 8.

The square of these numbers is also uniquely decomposable into a sum of two squares, thus this sequence is a subsequence of A084645.

Also a subsequence of A191217: the two sequences are equal up to a(76) = 320, then A191217(77) = 325, the value which is missing from this sequence, as a(77) = 328 = A191217(78). (3125 is also missing from this sequence, although present in A191217, and it is the 31st such number). - Corrected by Antti Karttunen, May 14 2022.

Numbers n such that n^3 is the sum of two nonzero squares in exactly two ways. - Altug Alkan, Jul 01 2016

Sequence A125022 (numbers with a unique partition as the sum of 2 squares x^2 + y^2), but without any terms of A028982 (squares and twice squares) that might occur there. - Antti Karttunen, May 14 2022

Antti Karttunen, Table of n, a(n) for n = 1..20000 (extending the previous b-file from Jean-Christophe Hervé, which contained terms up to the 1647th term 10009, but accidentally missed terms 8992 and 9376)

Terms are obtained by the products A125853(k)*A002144(p) for k, p > 0, ordered by increasing values.

a(1) = 5 = 4+1, a(2) = 10 = 9+1, a(3) = 13 = 9+4. However 2 = 1+1, 4 = 4+0, 8 = 4+4 are excluded because the unique decomposition of these numbers in two squares is not with two distinct nonzero squares; 25, 50, 100 are also excluded because there are two decompositions of these numbers in two squares (including one with equal or zero squares).

(PARI) isok(n) = {f = factor(n); nb1 = 0; for (i=1, #f~, p = f[i, 1]; ep = f[i, 2]; if (p % 4 == 1, nb1 ++; if (ep != 1, return (0))); if (p % 4 == 3, if (ep % 2, return (0))); ); return (nb1 == 1); } \\ Michel Marcus, Nov 17 2013