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”).
%I #9 Aug 03 2014 14:01:17
%S 0,1,2,3,4,5,6,9,10,12,13,14,17,18,20,21,22,25,26,30,33,34,36,38,41,
%T 42,45,46,49,50,52,54,57,58,62,65,66,68,70,73,74,78,81,82,84,86,89,90,
%U 94,97,98,100,102,105,106,110,114,118,122,126,129,130,132,134
%N Of course every number is the sum of 4 squares; for these numbers the first square can be taken to be any square < n.
%D J. H. Conway, personal communication, Aug 27, 2001.
%H T. D. Noe, <a href="/A063952/b063952.txt">Table of n, a(n) for n = 1..1105</a> (numbers < 4000)
%F Consists of 0, the 52 odd numbers in A063954, 4 times those numbers and all numbers of the form 4m+2.
%t t1 = {1, 3, 5, 9, 13, 17, 21, 25, 33, 41, 45, 49, 57, 65, 73, 81, 89, 97, 105, 129, 145, 153, 169, 177, 185, 201, 209, 217, 225, 257, 273, 297, 305, 313, 329, 345, 353, 385, 425, 433, 441, 481, 513, 561, 585, 609, 689, 697, 713, 817, 825, 945}; t = Union[{0}, t1, 4*t1, 4*Range[0,999] + 2] (* _T. D. Noe_, Feb 22 2012 *)
%Y Cf. A063949-A063954.
%K nonn,easy,nice
%O 1,3
%A _N. J. A. Sloane_, Sep 04 2001