|
| |
|
|
A000164
|
|
Number of partitions of n into 3 squares.
|
|
2
| |
|
|
1, 1, 1, 1, 1, 1, 1, 0, 1, 2, 1, 1, 1, 1, 1, 0, 1, 2, 2, 1, 1, 1, 1, 0, 1, 2, 2, 2, 0, 2, 1, 0, 1, 2, 2, 1, 2, 1, 2, 0, 1, 3, 1, 1, 1, 2, 1, 0, 1, 2, 3, 2, 1, 2, 3, 0, 1, 2, 1, 2, 0, 2, 2, 0, 1, 3, 3, 1, 2, 2, 1, 0, 2, 2, 3, 2, 1, 2, 1, 0, 1, 4, 2, 2, 1, 2, 3, 0, 1, 4, 3, 1, 0, 1, 2, 0, 1, 2, 3, 3, 2, 4, 2, 0, 2
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,10
|
|
|
REFERENCES
| E. Grosswald, Representations of Integers as Sums of Squares. Springer-Verlag, NY, 1985, p. 84.
Hirschhorn, M. D.; Some formulae for partitions into squares, DiscreteMath, 211 (2000), pp. 225-228. [From Ant King (mathstutoring(AT)ntlworld.com), Oct 15 2010]
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n = 0..10000
|
|
|
FORMULA
| Let e(n,r,s,m) be the excess of the number of n's r(mod m) divisors over the number of its s(mod m) divisors, and let delta(n)=1 if n is a perfect square and 0 otherwise. Then, if we define alpha(n)=5delta(n)+3 delta(1/2 n)+ 4delta(1/3 n), beta(n)=4e(n,1,3,4)+3e(n,1,7,8)+3e(n,3,5,8), gamma(n)=2 sum(e(n-k^2,1,3,4),1<=k^2<n), it follows that a(n)=1/12 (alpha(n)+beta(n)+gamma(n)) - Ant King (mathstutoring(AT)ntlworld.com), Oct 15 2010]
|
|
|
MATHEMATICA
| Contribution from Ant King (mathstutoring(AT)ntlworld.com), Oct 15 2010: (Start)
Length[PowersRepresentations[ #, 3, 2]] & /@ Range[0, 104]
e[0, r_, s_, m_]=0; e[n_, r_, s_, m_]:=Length[Select[Divisors[n], Mod[ #, m]==r &]]-Length[Select[Divisors[n], Mod[ #, m]==s &]]; alpha[n_]:=5delta[n]+3delta[1/2 n]+4delta[1/3n]; beta[n_]:=4e[n, 1, 3, 4]+3e[n, 1, 7, 8]+3e[n, 3, 5, 8]; delta[n_]:=If[IntegerQ[Sqrt[n]], 1, 0]; f[n_]:=Table[n-k^2, {k, 1, Floor[Sqrt[n]]}]; gamma[n_]:=2 Plus@@(e[ #, 1, 3, 4] &/@f[n]); p3[n_]:=1/12(alpha[n]+beta[n]+gamma[n]); p3[ # ] &/@Range[0, 104] (End)
|
|
|
CROSSREFS
| Sequence in context: A181506 A169987 A178666 * A157746 A037820 A076493
Adjacent sequences: A000161 A000162 A000163 * A000165 A000166 A000167
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
