login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A085616
Numbers n == 3 (mod 8) such that there is only one solution to i^2+j^2+k^2=n, i >= j >= k >= 0.
1
3, 11, 19, 35, 43, 67, 91, 115, 163, 235, 403, 427
OFFSET
1,1
LINKS
MATHEMATICA
aQ[n_] := Mod[n, 8]==3 && Length[Solve[i^2+j^2+k^2==n && k>=0 && j>=k && i>=j, {i, j, k}, Integers]] == 1; Select[Range[500], aQ] (* Amiram Eldar, Dec 04 2018 *)
CROSSREFS
Cf. A086719.
Sequence in context: A018557 A270528 A213540 * A138723 A099955 A138724
KEYWORD
nonn,fini,full
AUTHOR
N. J. A. Sloane, Jul 31 2003
STATUS
approved