A037444 -id:A037444 - cp's OEIS frontend

A320846 Expansion of Product_{k>=1} 1/(1 - x^(k^2))^A037444(k).

1, 1, 1, 1, 3, 3, 3, 3, 6, 10, 10, 10, 14, 22, 22, 22, 35, 47, 57, 57, 79, 95, 115, 115, 146, 217, 247, 267, 307, 433, 473, 513, 598, 779, 985, 1045, 1253, 1489, 1861, 1941, 2272, 2859, 3397, 3847, 4301, 5467, 6171, 6991, 7688, 9531, 11559, 12749, 14693

Offset: 0

Ilya Gutkovskiy, Nov 11 2018

nonn

a(n) is the number of partitions of n into squares k^2 of A037444(k) kinds.

			a(8) = 6 because we have [{4}, {4}], [{4}, {1, 1, 1, 1}], [{4}, {1}, {1}, {1}, {1}], [{1, 1, 1, 1}, {1, 1, 1, 1}], [{1, 1, 1, 1}, {1}, {1}, {1}, {1}] and [{1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}].

Index entries for sequences related to partitions

Cf. A000290, A001156, A001970, A037444, A045842, A285047, A300300.

b[n_] := b[n] = SeriesCoefficient[Product[1/(1 - x^k^2), {k, 1, n}], {x, 0, n^2}]; a[n_] := a[n] = SeriesCoefficient[Product[1/(1 - x^k^2)^b[k], {k, 1, n}], {x, 0, n}]; Table[a[n], {n, 0, 52}]

G.f.: Product_{k>=1} 1/(1 - x^A000290(k))^A001156(A000290(k)).

A001156 Number of partitions of n into squares.

Original entry on oeis.org

1, 1, 1, 1, 2, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 8, 9, 10, 10, 12, 13, 14, 14, 16, 19, 20, 21, 23, 26, 27, 28, 31, 34, 37, 38, 43, 46, 49, 50, 55, 60, 63, 66, 71, 78, 81, 84, 90, 98, 104, 107, 116, 124, 132, 135, 144, 154, 163, 169, 178, 192, 201, 209, 220, 235, 247, 256

Offset: 0

N. J. A. Sloane

Number of partitions of n such that number of parts equal to k is multiple of k for all k. - Vladeta Jovovic, Aug 01 2004
Of course p_{4*square}(n)>0. In fact p_{4*square}(32n+28)=3 times p_{4*square}(8n+7) and p_{4*square}(72n+69) is even. These seem to be the only arithmetic properties the function p_{4*square(n)} possesses. Similar results hold for partitions into positive squares, distinct squares and distinct positive squares. - Michael David Hirschhorn, May 05 2005
The Heinz numbers of these partitions are given by A324588. - Gus Wiseman, Mar 09 2019

			p_{4*square}(23)=1 because 23 = 3^2 + 3^2 + 2^2 + 1^2 and there is no other partition of 23 into squares.
G.f.: A(x) = 1 + x + x^2 + x^3 + 2*x^4 + 2*x^5 + 2*x^6 + 2*x^7 +...
such that the g.f. A(x) satisfies the identity [_Paul D. Hanna_]:
A(x) = 1/((1-x)*(1-x^4)*(1-x^9)*(1-x^16)*(1-x^25)*...)
A(x) = 1 + x/(1-x) + x^4/((1-x)*(1-x^4)) + x^9/((1-x)*(1-x^4)*(1-x^9)) + x^16/((1-x)*(1-x^4)*(1-x^9)*(1-x^16)) + ...
From _Gus Wiseman_, Mar 09 2019: (Start)
The a(14) = 6 integer partitions into squares are:
  (941)
  (911111)
  (44411)
  (44111111)
  (41111111111)
  (11111111111111)
while the a(14) = 6 integer partitions in which the multiplicity of k is a multiple of k for all k are:
  (333221)
  (33311111)
  (22222211)
  (2222111111)
  (221111111111)
  (11111111111111)
(End)

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Alois P. Heinz, Table of n, a(n) for n = 0..10000 (first 1001 terms from T. D. Noe)
J. Bohman et al., Partitions in squares, Nordisk Tidskr. Informationsbehandling (BIT) 19 (1979), 297-301.
J. Bohman et al., Partitions in squares, Nordisk Tidskr. Informationsbehandling (BIT) 19 (1979), 297-301. (Annotated scanned copy)
H. L. Fisher, Letter to N. J. A. Sloane, Mar 16 1989
G. H. Hardy and S. Ramanujan, Asymptotic formulae in combinatory analysis, Proceedings of the London Mathematical Society, 2, XVI, 1917, p. 373.
M. D. Hirschhorn and J. A. Sellers, On a problem of Lehmer on partitions into squares, The Ramanujan Journal 8 (2004), 279-287.
F. Iacobescu, Smarandache Partition Type and Other Sequences, Bull. Pure Appl. Sci. 16E, 237-240, 1997.
Martin Klazar, What is an answer? — remarks, results and problems on PIO formulas in combinatorial enumeration, part I, arXiv:1808.08449 [math.CO], 2018.
Igor Pak, Complexity problems in enumerative combinatorics, arXiv:1803.06636 [math.CO], 2018.
James A. Sellers, Partitions Excluding Specific Polygonal Numbers As Parts, Journal of Integer Sequences, Vol. 7 (2004), Article 04.2.4.
F. Smarandache, Sequences of Numbers Involved in Unsolved Problems, Hexis, Phoenix, 2006.
Florentin Smarandache, Sequences of Numbers Involved in Unsolved Problems, arXiv:math/0604019 [math.GM], 2006.
Eric Weisstein's World of Mathematics, Partition
Eric Weisstein's World of Mathematics, Smarandache Sequences
Eric Weisstein's World of Mathematics, Square Number

Cf. A000041, A000161 (partitions into 2 squares), A000290, A033461, A131799, A218494, A285218, A304046.
Cf. A078134 (first differences).
Cf. A003108, A037444, A046042, A259792, A259793, A294529.
Row sums of A243148.
Euler trans. of A010052 (see also A308297).
Cf. A001462, A003114, A006141, A011757, A039900, A047993, A052335, A062457, A064174, A078135, A109298, A117144.
Cf. A324524, A324572, A324587, A324588.

a001156 = p (tail a000290_list) where
   p _          0 = 1
   p ks'@(k:ks) m = if m < k then 0 else p ks' (m - k) + p ks m
-- Reinhard Zumkeller, Oct 31 2012, Aug 14 2011

m:=70; R:=PowerSeriesRing(Integers(), m); Coefficients(R!( (&*[1/(1-x^(k^2)): k in [1..(m+2)]]) )); // G. C. Greubel, Nov 11 2018

b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,
      b(n, i-1)+ `if`(i^2>n, 0, b(n-i^2, i))))
    end:
a:= n-> b(n, isqrt(n)):
seq(a(n), n=0..120);  # Alois P. Heinz, May 30 2014

CoefficientList[ Series[Product[1/(1 - x^(m^2)), {m, 70}], {x, 0, 68}], x] (* Or *)
Join[{1}, Table[Length@PowersRepresentations[n, n, 2], {n, 68}]] (* Robert G. Wilson v, Apr 12 2005, revised Sep 27 2011 *)
f[n_] := Length@ IntegerPartitions[n, All, Range@ Sqrt@ n^2]; Array[f, 67] (* Robert G. Wilson v, Apr 14 2013 *)
b[n_, i_] := b[n, i] = If[n==0, 1, If[i<1, 0, b[n, i-1] + If[i^2>n, 0, b[n-i^2, i]]]]; a[n_] := b[n, Sqrt[n]//Floor]; Table[a[n], {n, 0, 120}] (* Jean-François Alcover, Nov 02 2015, after Alois P. Heinz *)

{a(n)=polcoeff(1/prod(k=1, sqrtint(n+1), 1-x^(k^2)+x*O(x^n)), n)} \\ Paul D. Hanna, Mar 09 2012

{a(n)=polcoeff(1+sum(m=1, sqrtint(n+1), x^(m^2)/prod(k=1, m, 1-x^(k^2)+x*O(x^n))), n)} \\ Paul D. Hanna, Mar 09 2012

G.f.: Product_{m>=1} 1/(1-x^(m^2)).
G.f.: Sum_{n>=0} x^(n^2) / Product_{k=1..n} (1 - x^(k^2)). - Paul D. Hanna, Mar 09 2012
a(n) = (1/n)*Sum_{k=1..n} A035316(k)*a(n-k). - Vladeta Jovovic, Nov 20 2002
a(n) = f(n,1,3) with f(x,y,z) = if xReinhard Zumkeller, Nov 08 2009
Conjecture (Jan Bohman, Carl-Erik Fröberg, Hans Riesel, 1979): a(n) ~ c * n^(-alfa) * exp(beta*n^(1/3)), where c = 1/18.79656, beta = 3.30716, alfa = 1.16022. - Vaclav Kotesovec, Aug 19 2015
From Vaclav Kotesovec, Dec 29 2016: (Start)
Correct values of these constants are:
1/c = sqrt(3) * (4*Pi)^(7/6) / Zeta(3/2)^(2/3) = 17.49638865935104978665...
alfa = 7/6 = 1.16666666666666666...
beta = 3/2 * (Pi/2)^(1/3) * Zeta(3/2)^(2/3) = 3.307411783596651987...
a(n) ~ 3^(-1/2) * (4*Pi*n)^(-7/6) * Zeta(3/2)^(2/3) * exp(2^(-4/3) * 3 * Pi^(1/3) * Zeta(3/2)^(2/3) * n^(1/3)). [Hardy & Ramanujan, 1917]
(End)

More terms from Eric W. Weisstein

More terms from Gh. Niculescu (ghniculescu(AT)yahoo.com), Oct 08 2006

A003108 Number of partitions of n into cubes.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 11, 11, 11, 12, 12, 13, 13, 13, 14, 14, 14, 15, 15, 17, 17, 17, 18, 18, 18, 19, 19, 21, 21, 21, 22, 22, 22, 23, 23, 25, 26, 26, 27, 27, 27, 28

Offset: 0

N. J. A. Sloane, Herman P. Robinson

nonn

The g.f. 1/(z+1)/(z**2+1)/(z**4+1)/(z-1)**2 conjectured by Simon Plouffe in his 1992 dissertation is wrong.

			a(16) = 3 because we have [8,8], [8,1,1,1,1,1,1,1,1] and [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1].
G.f.: A(x) = 1 + x + x^2 + x^3 + x^4 + x^5 + x^6 + x^7 + 2*x^8 +...
such that the g.f. A(x) satisfies the identity [Paul D. Hanna]:
A(x) = 1/((1-x)*(1-x^8)*(1-x^27)*(1-x^64)*(1-x^125)*...)
A(x) = 1 + x/(1-x) + x^8/((1-x)*(1-x^8)) + x^27/((1-x)*(1-x^8)*(1-x^27)) + x^64/((1-x)*(1-x^8)*(1-x^27)*(1-x^64)) +...

H. P. Robinson, Letter to N. J. A. Sloane, Jan 04 1974.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
F. Smarandache, Sequences of Numbers Involved in Unsolved Problems, Hexis, Phoenix, 2006.

T. D. Noe and Vaclav Kotesovec, Table of n, a(n) for n = 0..100000 (terms 0..1000 from T. D. Noe)
G. H. Hardy and S. Ramanujan, Asymptotic formulae in combinatory analysis, Proceedings of the London Mathematical Society, 2, XVI, 1917, p. 373.
F. Iacobescu, Smarandache Partition Type and Other Sequences, Bull. Pure Appl. Sci. 16E, 237-240, 1997.
Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992
Herman P. Robinson, Letter to N. J. A. Sloane, Jan 1974.
F. Smarandache, Sequences of Numbers Involved in Unsolved Problems.
Eric Weisstein's World of Mathematics, Cubic Number
Eric Weisstein's World of Mathematics, Partition
Eric Weisstein's World of Mathematics, Smarandache Sequences

Cf. A000578, A068980, A131799, A218495, A226748, A279329, A280263.
Cf. A001156, A046042.
Cf. A037444, A259792, A259793.

a003108 = p $ tail a000578_list where
   p _          0 = 1
   p ks'@(k:ks) m = if m < k then 0 else p ks' (m - k) + p ks m
-- Reinhard Zumkeller, Oct 31 2012

[#RestrictedPartitions(n,{d^3:d in [1..n]}): n in [0..150]]; // Marius A. Burtea, Jan 02 2019

g:=1/product(1-x^(j^3),j=1..30): gser:=series(g,x=0,70): seq(coeff(gser,x,n),n=0..65); # Emeric Deutsch, Mar 30 2006

nmax = 100; CoefficientList[Series[Product[1/(1 - x^(k^3)), {k, 1, nmax^(1/3)}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Aug 19 2015 *)
nmax = 60; cmax = nmax^(1/3);
s = Table[n^3, {n, cmax}];
Table[Count[IntegerPartitions@n, x_ /; SubsetQ[s, x]], {n, 0, nmax}] (* Robert Price, Jul 31 2020 *)

{a(n)=polcoeff(1/prod(k=1, ceil(n^(1/3)), 1-x^(k^3)+x*O(x^n)), n)} /* Paul D. Hanna, Mar 09 2012 */

{a(n)=polcoeff(1+sum(m=1, ceil(n^(1/3)), x^(m^3)/prod(k=1, m, 1-x^(k^3)+x*O(x^n))), n)} /* Paul D. Hanna, Mar 09 2012 */

from functools import lru_cache
from sympy import integer_nthroot, divisors
@lru_cache(maxsize=None)
def A003108(n):
    @lru_cache(maxsize=None)
    def a(n): return integer_nthroot(n,3)[1]
    @lru_cache(maxsize=None)
    def c(n): return sum(d for d in divisors(n,generator=True) if a(d))
    return (c(n)+sum(c(k)*A003108(n-k) for k in range(1,n)))//n if n else 1 # Chai Wah Wu, Jul 15 2024

G.f.: 1/Product_{j>=1} (1-x^(j^3)). - Emeric Deutsch, Mar 30 2006
G.f.: Sum_{n>=0} x^(n^3) / Product_{k=1..n} (1 - x^(k^3)). - Paul D. Hanna, Mar 09 2012
a(n) ~ exp(4 * (Gamma(1/3)*Zeta(4/3))^(3/4) * n^(1/4) / 3^(3/2)) * (Gamma(1/3)*Zeta(4/3))^(3/4) / (24*Pi^2*n^(5/4)) [Hardy & Ramanujan, 1917]. - Vaclav Kotesovec, Dec 29 2016

A259792 Number of partitions of n^3 into cubes.

Original entry on oeis.org

1, 1, 2, 5, 17, 62, 258, 1050, 4365, 18012, 73945, 301073, 1214876, 4852899, 19187598, 75070201, 290659230, 1113785613, 4224773811, 15866483556, 59011553910, 217410395916, 793635925091, 2871246090593, 10297627606547, 36620869115355, 129166280330900

Offset: 0

N. J. A. Sloane, Jul 06 2015

nonn

Alois P. Heinz and Vaclav Kotesovec, Table of n, a(n) for n = 0..173 (terms 0..120 from Alois P. Heinz)
H. L. Fisher, Letter to N. J. A. Sloane, Mar 16 1989
G. H. Hardy and S. Ramanujan, Asymptotic formulae in combinatory analysis, Proceedings of the London Mathematical Society, 2, XVI, 1917, p. 373.

A row of the array in A259799.
Cf. A279329.
Cf. A001156, A003108, A046042.
Cf. A037444, A259793.

b:= proc(n, i) option remember; `if`(n=0 or i=1, 1,
      b(n, i-1) +`if`(i^3>n, 0, b(n-i^3, i)))
    end:
a:= n-> b(n^3, n):
seq(a(n), n=0..26);  # Alois P. Heinz, Jul 10 2015

$RecursionLimit = 1000; b[n_, i_] := b[n, i] = If[n==0 || i==1, 1, b[n, i-1] + If[ i^3>n, 0, b[n-i^3, i]]]; a[n_] := b[n^3, n]; Table[a[n], {n, 0, 26}] (* Jean-François Alcover, Jul 15 2015, after Alois P. Heinz *)

a(n) = [x^(n^3)] Product_{j>=1} 1/(1-x^(j^3)). - Alois P. Heinz, Jul 10 2015
a(n) = A003108(n^3). - Vaclav Kotesovec, Aug 19 2015
a(n) ~ exp(4 * (Gamma(1/3)*Zeta(4/3))^(3/4) * n^(3/4) / 3^(3/2)) * (Gamma(1/3)*Zeta(4/3))^(3/4) / (24*Pi^2*n^(15/4)) [after Hardy & Ramanujan, 1917]. - Vaclav Kotesovec, Dec 29 2016

More term from Alois P. Heinz, Jul 10 2015

A030273 Number of partitions of n^2 into distinct squares.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 2, 1, 3, 3, 4, 2, 7, 8, 12, 13, 16, 25, 28, 55, 51, 91, 90, 158, 176, 288, 297, 487, 521, 847, 908, 1355, 1580, 2175, 2744, 3636, 4452, 5678, 7385, 9398, 11966, 14508, 19322, 23065, 31301, 36177, 49080, 57348, 77446, 91021, 121113, 141805

Offset: 0

Warren D. Smith

nonn

Alois P. Heinz and Vaclav Kotesovec, Table of n, a(n) for n = 0..1000 (terms 0..750 from Alois P. Heinz)

Cf. A037444, A033461, A000009, A000290.

a030273 n = p (map (^ 2) [1..]) (n^2) where
   p _  0 = 1
   p (k:ks) m | m < k     = 0
              | otherwise = p ks (m - k) + p ks m
-- Reinhard Zumkeller, Aug 14 2011

b:= proc(n, i) option remember; `if`(n=0, 1,
      `if`(n>i*(i+1)*(2*i+1)/6, 0, b(n, i-1)+
      `if`(i^2>n, 0, b(n-i^2, i-1))))
    end:
a:= n-> b(n^2, n):
seq(a(n), n=0..50);  # Alois P. Heinz, Nov 20 2012

b[n_, i_] := b[n, i] = If[n==0, 1, If[n > i*(i+1)*(2*i+1)/6, 0, b[n, i-1] +If[i^2 > n, 0, b[n-i^2, i-1]]]]; a[n_] := b[n^2, n]; Table[a[n], {n, 0, 50}] (* Jean-François Alcover, Jul 30 2015, after Alois P. Heinz *)

a(n) = [x^(n^2)] Product_{k>=1} (1 + x^(k^2)). - Ilya Gutkovskiy, Apr 13 2017

a(0)=1 prepended by Alois P. Heinz, Feb 18 2015

A046042 Number of partitions of n into fourth powers.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 9, 9, 9, 9, 9, 9

Offset: 1

Eric W. Weisstein

nonn

In general, the number of partitions of n into perfect s-th powers (s>=1) is asymptotic to (2*Pi)^(-(s+1)/2) * sqrt(s/(s+1)) * k * n^(1/(s+1)-3/2) * exp((s+1)*k*n^(1/(s+1))), where k = (Gamma(1 + 1/s) * Zeta(1 + 1/s) / s)^(s/(s+1)) [Hardy & Ramanujan, 1917]. - Vaclav Kotesovec, Dec 29 2016

			a(33) = 3 because we have [16,16,1], [16,1,1,...,1] (17 1's) and [1,1,...,1] (33 1's).

H. P. Robinson, Letter to N. J. A. Sloane, Jan 04 1974.

Alois P. Heinz, Table of n, a(n) for n = 1..10000
G. H. Hardy and S. Ramanujan, Asymptotic formulae in combinatory analysis, Proceedings of the London Mathematical Society, 2, XVI, 1917, p. 373.
Herman P. Robinson, Letter to N. J. A. Sloane, Jan 1974.
Eric Weisstein's World of Mathematics, Partition

Cf. A000583, A002377, A003105.
Cf. A001156, A003108, A046042.
Cf. A037444, A259792, A259793.

a046042 = p $ tail a000583_list where
   p _          0 = 1
   p ks'@(k:ks) m = if m < k then 0 else p ks' (m - k) + p ks m
-- Reinhard Zumkeller, May 18 2015   ~

g:=-1+1/product(1-x^(j^4),j=1..10): gser:=series(g,x=0,105): seq(coeff(gser,x,n),n=1..102); # Emeric Deutsch, Apr 06 2006

g = -1 + 1/Product[1 - x^(j^4), {j, 1, 10}]; gser =
Series[g, {x, 0, 105}]; Table[Coefficient[gser, x, n], {n, 1, 102}] (* Jean-François Alcover, Oct 29 2012, after Emeric Deutsch *)

G.f.: -1+1/product(1-x^(j^4),j=1..infinity). - Emeric Deutsch, Apr 06 2006
a(n) ~ exp(5 * (Gamma(1/4)*Zeta(5/4))^(4/5) * n^(1/5) / 2^(16/5)) * (Gamma(1/4)*Zeta(5/4))^(4/5) / (2^(47/10) * sqrt(5) * Pi^(5/2) * n^(13/10)) [Hardy & Ramanujan, 1917]. - Vaclav Kotesovec, Dec 29 2016
G.f.: Sum_{i>=1} x^(i^4) / Product_{j=1..i} (1 - x^(j^4)). - Ilya Gutkovskiy, May 07 2017

A259793 Number of partitions of n^4 into fourth powers.

Original entry on oeis.org

1, 1, 2, 7, 36, 253, 1886, 14800, 118238, 955639, 7750456, 62777522, 506272363, 4056634991, 32252971687, 254209569990, 1985108901344, 15352968310930, 117579612410477, 891596419221856, 6694250497509934, 49768995849050468, 366423320400440927, 2671969175372760210

Offset: 0

N. J. A. Sloane, Jul 06 2015

nonn

Alois P. Heinz and Vaclav Kotesovec, Table of n, a(n) for n = 0..63 (terms 0..45 from Alois P. Heinz)
H. L. Fisher, Letter to N. J. A. Sloane, Mar 16 1989
G. H. Hardy and S. Ramanujan, Asymptotic formulae in combinatory analysis, Proceedings of the London Mathematical Society, 2, XVI, 1917, p. 373.

A row of the array in A259799.
Cf. A001156, A003108, A046042.
Cf. A037444, A259792.

b:= proc(n, i) option remember; `if`(n=0 or i=1, 1,
      b(n, i-1) +`if`(i^4>n, 0, b(n-i^4, i)))
    end:
a:= n-> b(n^4, n):
seq(a(n), n=0..23);  # Alois P. Heinz, Jul 10 2015

$RecursionLimit = 10^4; b[n_, i_] := b[n, i] = If[n==0 || i==1, 1, b[n, i-1] + If[i^4>n, 0, b[n-i^4, i]]]; a[n_] := b[n^4, n];  Table[a[n], {n, 0, 23}] (* Jean-François Alcover, Dec 06 2016 after Alois P. Heinz *)

a(n) = [x^(n^4)] Product_{j>=1} 1/(1-x^(j^4)). - Alois P. Heinz, Jul 10 2015
a(n) = A046042(n^4). - Vaclav Kotesovec, Aug 19 2015
a(n) ~ exp(5 * (Gamma(1/4)*Zeta(5/4))^(4/5) * n^(4/5) / 2^(16/5)) * (Gamma(1/4)*Zeta(5/4))^(4/5) / (2^(47/10) * sqrt(5) * Pi^(5/2) * n^(26/5)) [after Hardy & Ramanujan, 1917]. - Vaclav Kotesovec, Dec 29 2016

More terms from Alois P. Heinz, Jul 10 2015

A298330 Number of ordered ways of writing n^2 as a sum of n squares of positive integers.

Original entry on oeis.org

1, 1, 0, 3, 1, 5, 141, 742, 6120, 43888, 300232, 3074478, 28901797, 290411147, 3175037698, 34951274416, 399750066121, 4814421349467, 59532792202344, 768079420764884, 10247011240209066, 140144002390928732, 1978092111496441512, 28633995987157024399

Offset: 0

Ilya Gutkovskiy, Jan 17 2018

nonn

			a(3) = 3 because we have [4, 4, 1], [4, 1, 4] and [1, 4, 4].

Robert Israel, Table of n, a(n) for n = 0..100
Index entries for sequences related to sums of squares

Cf. A037444, A066535, A232173, A287617, A298329.

G:= (JacobiTheta3(0,x)-1)/2:
f:= proc(n) local S; S:= series(G^n,x,n^2+1); coeff(S,x,n^2) end proc:
map(f, [$0..25]); # Robert Israel, Dec 16 2024

Table[SeriesCoefficient[(-1 + EllipticTheta[3, 0, x])^n/2^n, {x, 0, n^2}], {n, 0, 23}]

a(n) = [x^(n^2)] (Sum_{k>=1} x^(k^2))^n.

A298329 Number of ordered ways of writing n^2 as a sum of n squares of nonnegative integers.

Original entry on oeis.org

1, 1, 2, 6, 5, 90, 582, 4081, 45678, 378049, 3844532, 39039539, 395170118, 4589810849, 53154371025, 660113986997, 8584476248237, 113555197832758, 1572878837435750, 22259911738401660, 324143769099772448, 4869443438412466557, 74837370448784241452, 1182177603062005007658

Offset: 0

Ilya Gutkovskiy, Jan 17 2018

nonn

			a(3) = 6 because we have [9, 0, 0], [4, 4, 1], [4, 1, 4], [1, 4, 4], [0, 9, 0] and [0, 0, 9].

Alois P. Heinz, Table of n, a(n) for n = 0..100 (first 81 terms from Seiichi Manyama)
Index entries for sequences related to sums of squares

[x^(n^b)] (Sum_{k>=0} x^(k^b))^n: A088218 (b=1), this sequence (b=2), A298671 (b=3).

Cf. A037444, A066535, A232173, A287617, A298330, A300446.

b:= proc(n, i, t) option remember; `if`(n=0, 1/t!, (s->
     `if`(s*t n!*b(n^2, n$2):
seq(a(n), n=0..25);  # Alois P. Heinz, Oct 28 2018

Table[SeriesCoefficient[(1 + EllipticTheta[3, 0, x])^n/2^n, {x, 0, n^2}], {n, 0, 23}]

{a(n) = polcoeff((sum(k=0, n, x^(k^2)+x*O(x^(n^2))))^n, n^2)} \\ Seiichi Manyama, Oct 28 2018

a(n) = [x^(n^2)] (Sum_{k>=0} x^(k^2))^n.

A259799 Array read by antidiagonals upwards: T(n,k) = number of partitions of k^n into n-th powers (n>=1, k>=0).

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1, 2, 4, 5, 1, 1, 2, 5, 8, 7, 1, 1, 2, 7, 17, 19, 11, 1, 1, 2, 9, 36, 62, 43, 15, 1, 1, 2, 13, 88, 253, 258, 98, 22, 1, 1, 2, 19, 218, 1104, 1886, 1050, 220, 30, 1, 1, 2, 27, 550, 5082, 15772, 14800, 4365, 504, 42, 1, 1, 2, 40, 1413, 24119, 140549, 241582, 118238, 18012, 1116, 56

Offset: 1

N. J. A. Sloane, Jul 06 2015

			The array begins:
  1, 1, 2, 3, 5, 7, 11, 15, 22, 30, ...
  1, 1, 2, 4, 8, 19, 43, 98, 220, 504, ...
  1, 1, 2, 5, 17, 62, 258, 1050, 4365, 18012, ...
  1, 1, 2, 7, 36, 253, 1886, 14800, 118238, ...
  1, 1, 2, 9, 88, 1104, 15772, 241582, ...
  ...

Alois P. Heinz, Antidiagonals n = 1..16, flattened
H. L. Fisher, Letter to N. J. A. Sloane, Mar 16 1989

Rows: A000041, A037444, A259792-A259795.
Columns: A259796, A027601, A259797, A259798.
T(n,n) gives A331402.

b:= proc(n, i, k) option remember; `if`(n=0 or i=1, 1,
      `if`(i=2, 1+iquo(n, i^k), b(n, i-1, k)+
      `if`(i^k>n, 0, b(n-i^k, i, k))))
    end:
T:= (n, k)-> b(k^n, k, n):
seq(seq(T(d-k, k), k=0..d-1), d=1..12);  # Alois P. Heinz, Jul 10 2015

b[n_, i_, k_] := b[n, i, k] = If[n==0 || i==1, 1, If[i==2, 1+Quotient[n, i^k], b[n, i-1, k] + If[i^k>n, 0, b[n-i^k, i, k]]]]; T[n_, k_] := b[k^n, k, n]; Table[ Table[ T[d-k, k], {k, 0, d-1}], {d, 1, 12}] // Flatten (* Jean-François Alcover, Jul 15 2015, after Alois P. Heinz *)

More terms from Alois P. Heinz, Jul 10 2015

cp's OEIS Frontend

A320846 Expansion of Product_{k>=1} 1/(1 - x^(k^2))^A037444(k).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A001156 Number of partitions of n into squares.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

PARI

Formula

Extensions

A003108 Number of partitions of n into cubes.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

PARI

Python

Formula

A259792 Number of partitions of n^3 into cubes.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A030273 Number of partitions of n^2 into distinct squares.

Views

Author

Keywords

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

Formula

Extensions

A046042 Number of partitions of n into fourth powers.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs