This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A094942 #27 Oct 31 2019 16:15:06
%S A094942 0,1,2,3,4,5,6,8,10,11,12,13,14,16,19,20,21,22,24,30,32,35,37,40,42,
%T A094942 43,44,46,48,52,56,58,64,67,70,76,78,80,84,88,91,93,96,115,120,128,
%U A094942 133,140,142,148,160,163,168,172,176,184,190,192,208,224,232,235
%N A094942 Numbers having a unique partition into three squares.
%C A094942 Note that squares are allowed to be zero.
%C A094942 From _Wolfdieter Lang_, Apr 09 2013: (Start)
%C A094942 These are the numbers for which A000164(a(n)) = 1.
%C A094942 a(n) is the n-th largest number which has a representation as a sum of three squares (square 0 allowed), in exactly one way, if neither the order of terms nor the signs of the numbers to be squared are taken into account. The multiplicity with order and signs taken into account are A005875(a(n)).
%C A094942 These numbers are a proper subset of A000378.
%C A094942 (End)
%C A094942 Note that all these numbers are 4^k * A094739(n) for some k >= 0. - _T. D. Noe_, Nov 08 2013
%H A094942 T. D. Noe, <a href="/A094942/b094942.txt">Table of n, a(n) for n = 1..1000</a>
%F A094942 The sequence gives the increasingly ordered members of the set {m integer | A000164(m) = 1, m >= 0}.
%e A094942 From _Wolfdieter Lang_, Apr 09 2013 (Start)
%e A094942 a(1) = 0 because 0 = 0^2 + 0^2 + 0^2 and 0 is the first number m with A000164(m)=1.
%e A094942 a(8) = 8 = 0^2 + 2^2 + 2^2, the 8th largest number m for which A000164(m) is 1.
%e A094942 (End)
%t A094942 lim=25; nLst=Table[0, {lim^2}]; Do[n=a^2+b^2+c^2; If[n>0 && n<lim^2, nLst[[n]]++ ], {a, 0, lim}, {b, a, Sqrt[lim^2-a^2]}, {c, b, Sqrt[lim^2-a^2-b^2]}]; Flatten[Position[nLst, 1]]
%t A094942 Select[Range[0, 235], Length@PowersRepresentations[#, 3, 2] == 1 &] (* _Ray Chandler_, Oct 31 2019 *)
%Y A094942 Cf. A025321 (numbers having a unique partition into three positive squares), A094739 (primitive n having a unique partition into three squares).
%Y A094942 Cf. A000164, A005875, A000378, A224442 (two ways), A224443 (three ways).
%K A094942 nonn
%O A094942 1,3
%A A094942 _T. D. Noe_, May 24 2004
%E A094942 0 added by _T. D. Noe_, Apr 09 2013