A223731 All positive numbers that are primitive sums of three nonzero squares.
3, 6, 9, 11, 14, 17, 18, 19, 21, 22, 26, 27, 29, 30, 33, 34, 35, 38, 41, 42, 43, 45, 46, 49, 50, 51, 53, 54, 57, 59, 61, 62, 65, 66, 67, 69, 70, 73, 74, 75, 77, 78, 81, 82, 83, 86, 89, 90, 91, 93, 94, 97, 98, 99, 101, 102, 105, 106, 107, 109, 110, 113, 114, 115, 117, 118
Offset: 1
Keywords
Examples
a(12) = 27 because 27 is the 12th number for which A223730 is nonzero. Because A223730(27) = 1 there is only one primitive sum of three nonzero squares which is 27 denoted by [1,1,5]: 1^2 + 1^2 + 5^2 = 27. a(28) = 54 has two primitive representations in question, namely [1,2,7] and [2,5,5]. A223730(54) = 2. The representation [3,3,6] is not primitive because gcd(3,3,6) = 3 not 1. a(34) = 66 has three representations in question, namely [1,1,8], [1,4,7] and [4,5,5].
Links
- Alois P. Heinz, Table of n, a(n) for n = 1..1000
- F. Halter-Koch, Darstellung natürlicher Zahlen als Summe von Quadraten, Acta Arith. 42 (1982) 11-20.
Programs
-
Mathematica
threeSquaresQ[n_] := Select[ PowersRepresentations[n, 3, 2], Times @@ #1 != 0 && GCD @@ #1 == 1 & ] != {}; Select[Range[120], threeSquaresQ] (* Jean-François Alcover, Jun 21 2013 *)
Formula
The sequence a(n) is obtained from the ordered set
{m positive integer | m = a^2 + b^2 + c^2 , a,b,c integer, 0 < a <= b <= c, gcd(a,b,c) = 1} with entries appearing only once.
Conjectured g.f.: (x^77 +2*x^76 -2*x^75 +x^74 -x^73 -x^72 +2*x^50 -x^49 +2*x^47 -2*x^46 -x^45 +x^34 +2*x^33 -2*x^32 +x^31 -x^30 -x^29 +2*x^22 -x^21 +2*x^19 -2*x^18 -x^17 +3*x^15 -2*x^14 +x^13 -x^12 -x^10 +2*x^9 +2*x^7 +2*x^6 -3*x^4 -2*x^3 -3*x^2 -3*x -3)*x / (-x^6 +x^5 +x -1). - Alois P. Heinz, Apr 06 2013
Comments