A093115 -id:A093115 - cp's OEIS frontend

A092362 Number of partitions of n^2 into squares greater than 1.

1, 0, 1, 1, 2, 3, 5, 8, 11, 28, 44, 94, 167, 354, 643, 1314, 2412, 4792, 8981, 17374, 32566, 62008, 115702, 217040, 402396, 745795, 1372266, 2517983, 4595652, 8354350, 15125316, 27265107, 48972467, 87584837, 156119631, 277152178, 490437445, 864534950

Offset: 0

Reinhard Zumkeller, Mar 19 2004

nonn

a(n) = A078134(A000290(n)).

			a(6) = 5: 6^2 = 36 = 16+16+4 = 16+4+4+4+4+4 = 9+9+9+9 = 4+4+4+4+4+4+4+4+4.

Alois P. Heinz, Table of n, a(n) for n = 0..500

Cf. A001156, A037444.

Cf. A093115, A093116.

b:=proc(n, i) option remember; `if`(n=0, 1,
     `if`(i<2, 0, b(n, i-1) +`if`(i^2>n, 0, b(n-i^2, i))))
   end:
a:= n-> b(n^2, n):
seq(a(n), n=0..50);  # Alois P. Heinz, Apr 15 2013

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

a(n) ~ exp(3*Pi^(1/3) * Zeta(3/2)^(2/3) * n^(2/3) / 2^(4/3)) * Zeta(3/2)^(4/3) / (2^(11/3) * sqrt(3) * Pi^(5/6) * n^(11/3)). - Vaclav Kotesovec, Apr 10 2017

Corrected a(0) and more terms from Alois P. Heinz, Apr 15 2013

A093116 Number of partitions of n^2 into squares not less than n.

Original entry on oeis.org

1, 1, 1, 1, 2, 2, 2, 1, 2, 5, 4, 4, 5, 9, 15, 23, 24, 13, 20, 32, 55, 84, 113, 185, 303, 545, 167, 298, 435, 716, 1055, 1701, 2584, 4213, 6471, 10218, 15884, 4856, 7376, 11231, 17221, 26054, 39583, 60109, 91622, 138569, 209951, 318368, 483098, 730183

Offset: 0

Reinhard Zumkeller, Mar 21 2004

nonn

			n=10: 10^2 = 100 = 64+36 = 36+16+16+16+16 = 25+25+25+25, all other partitions of 100 into squares contain parts < 10, therefore a(10) = 4.

Alois P. Heinz, Table of n, a(n) for n = 0..250

Cf. A093115, A092362, A001156, A037444, A078134.

Cf. A072213, A161408. [Reinhard Zumkeller, Jun 10 2009]

b:= proc(n, i) option remember; `if`(n=0, 1,
     `if`(i^2>n, 0, b(n, i+1) +b(n-i^2, i)))
    end:
a:= proc(n) local r; r:= isqrt(n);
      b(n^2, r+`if`(r^2Alois P. Heinz, Apr 15 2013

b[n_, i_] := b[n, i] = If[n==0, 1, If[i^2>n, 0, b[n, i+1] + b[n-i^2, i]]]; a[n_] := With[{r = Sqrt[n]//Floor}, b[n^2, r + If[r^2Jean-François Alcover, Oct 26 2015, after Alois P. Heinz *)

A161407 Number of partitions of n^2 into parts smaller than n.

Original entry on oeis.org

1, 0, 1, 5, 30, 185, 1226, 8442, 60289, 442089, 3314203, 25295011, 195990980, 1538069121, 12203218743, 97746332667, 789480879664, 6423539487002, 52607252796831, 433368610079872, 3588859890833443, 29862449600982149, 249560820679038935, 2093852201126089073

Offset: 0

Reinhard Zumkeller, Jun 10 2009

nonn

			a(3) = #{2+2+2+2+1, 2+2+2+1+1+1, 2+2+5x1, 2+7x1, 9x1} = 5.

Alois P. Heinz, Table of n, a(n) for n = 0..320

Cf. A072213, A093115, A109655, A161408.

a := proc (n) local G, Gser: G := 1/(product(1-x^j, j = 1 .. n-1)): Gser := series(G, x = 0, n^2+5): coeff(Gser, x, n^2) end proc: 1, seq(a(n), n = 1 .. 23); # Emeric Deutsch, Jun 20 2009
# second Maple program:
b:= proc(n, i) option remember; `if`(n=0, 1,
     `if`(i<1, 0, b(n, i-1)+`if`(i>n, 0, b(n-i, i))))
    end:
a:= n-> b(n^2, n-1):
seq(a(n), n=0..30);  # Alois P. Heinz, Dec 21 2014

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

a(n) ~ c * d^n / n^2, where d = A258268 = 9.153370192454122461948530292401354... and c = 0.0881548837986971165169272782933415... - Vaclav Kotesovec, Sep 08 2021

More terms from Emeric Deutsch, Jun 20 2009

a(0)=1 from Alois P. Heinz, Dec 21 2014

A298642 Number of partitions of n^2 into distinct squares > 1.

Original entry on oeis.org

1, 0, 1, 1, 1, 2, 1, 2, 1, 2, 2, 2, 1, 5, 2, 10, 4, 12, 12, 11, 19, 23, 43, 50, 55, 78, 120, 126, 234, 207, 407, 385, 701, 712, 1090, 1231, 1850, 2102, 3054, 3385, 4988, 5584, 7985, 9746, 12205, 15737, 18968, 25157, 30927, 39043, 47708, 61915, 74592, 99554

Offset: 0

Ilya Gutkovskiy, Jan 24 2018

nonn

			a(5) = 2 because we have [25] and [16, 9].

Cf. A000290, A001156, A030273, A033461, A037444, A078134, A092362, A093115, A093116, A280129, A298640.

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

a(n) = A280129(A000290(n)).

cp's OEIS Frontend

A092362 Number of partitions of n^2 into squares greater than 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A093116 Number of partitions of n^2 into squares not less than n.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A161407 Number of partitions of n^2 into parts smaller than n.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A298642 Number of partitions of n^2 into distinct squares > 1.

Views

Author

Keywords

Examples

Links

Crossrefs

Formula