A308680
Number T(n,k) of colored integer partitions of n such that all colors from a k-set are used and parts differ by size or by color; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
Original entry on oeis.org
1, 0, 1, 0, 1, 1, 0, 2, 2, 1, 0, 2, 5, 3, 1, 0, 3, 8, 9, 4, 1, 0, 4, 14, 19, 14, 5, 1, 0, 5, 22, 39, 36, 20, 6, 1, 0, 6, 34, 72, 85, 60, 27, 7, 1, 0, 8, 50, 128, 180, 160, 92, 35, 8, 1, 0, 10, 73, 216, 360, 381, 273, 133, 44, 9, 1, 0, 12, 104, 354, 680, 845, 720, 434, 184, 54, 10, 1
Offset: 0
T(4,1) = 2: 3a1a, 4a.
T(4,2) = 5: 2a1a1b, 2b1a1b, 2a2b, 3a1b, 3b1a.
T(4,3) = 3: 2a1b1c, 2b1a1c, 2c1a1b.
T(4,4) = 1: 1a1b1c1d.
Triangle T(n,k) begins:
1;
0, 1;
0, 1, 1;
0, 2, 2, 1;
0, 2, 5, 3, 1;
0, 3, 8, 9, 4, 1;
0, 4, 14, 19, 14, 5, 1;
0, 5, 22, 39, 36, 20, 6, 1;
0, 6, 34, 72, 85, 60, 27, 7, 1;
0, 8, 50, 128, 180, 160, 92, 35, 8, 1;
0, 10, 73, 216, 360, 381, 273, 133, 44, 9, 1;
...
Columns k=0-10 give:
A000007,
A000009 (for n>0),
A327380,
A327381,
A327382,
A327383,
A327384,
A327385,
A327386,
A327387,
A327388.
-
b:= proc(n, i, k) option remember; `if`(n=0, 1, `if`(i<1, 0, add((t->
b(t, min(t, i-1), k)*binomial(k, j))(n-i*j), j=0..min(k, n/i))))
end:
T:= (n, k)-> add(b(n$2, k-i)*(-1)^i*binomial(k, i), i=0..k):
seq(seq(T(n, k), k=0..n), n=0..12);
# second Maple program:
b:= proc(n) option remember; `if`(n=0, 1, add(b(n-j)*add(
`if`(d::odd, d, 0), d=numtheory[divisors](j)), j=1..n)/n)
end:
T:= proc(n, k) option remember;
`if`(k=0, `if`(n=0, 1, 0), `if`(k=1, `if`(n=0, 0, b(n)),
(q-> add(T(j, q)*T(n-j, k-q), j=0..n))(iquo(k, 2))))
end:
seq(seq(T(n, k), k=0..n), n=0..12); # Alois P. Heinz, Jan 31 2021
# Uses function PMatrix from A357368.
PMatrix(10, A000009); # Peter Luschny, Oct 19 2022
-
b[n_, i_, k_] := b[n, i, k] = If[n == 0, 1, If[i < 1, 0, Sum[Function[t, b[t, Min[t, i - 1], k]*Binomial[k, j]][n - i*j], {j, 0, Min[k, n/i]}]]];
T[n_, k_] := Sum[b[n, n, k - i]*(-1)^i*Binomial[k, i], {i, 0, k}];
Table[Table[T[n, k], {k, 0, n}], {n, 0, 12}] // Flatten (* Jean-François Alcover, Dec 06 2019, from Maple *)
A341228
Expansion of (-1 + Product_{k>=1} 1 / (1 - x^k))^9.
Original entry on oeis.org
1, 18, 171, 1149, 6147, 27891, 111567, 403722, 1345896, 4189334, 12300174, 34337403, 91721385, 235645425, 584759880, 1406588073, 3289489002, 7498465029, 16697615817, 36391839264, 77758115283, 163123713621, 336420277812, 682877289213, 1365674365197, 2693384989056
Offset: 9
-
b:= proc(n, k) option remember; `if`(k<2, `if`(n=0, 1-k, combinat[
numbpart](n)), (q-> add(b(j, q)*b(n-j, k-q), j=0..n))(iquo(k, 2)))
end:
a:= n-> b(n, 9):
seq(a(n), n=9..34); # Alois P. Heinz, Feb 07 2021
-
nmax = 34; CoefficientList[Series[(-1 + Product[1/(1 - x^k), {k, 1, nmax}])^9, {x, 0, nmax}], x] // Drop[#, 9] &
A341251
Expansion of (-1 + Product_{k>=1} 1 / (1 + (-x)^k))^9.
Original entry on oeis.org
1, 0, 9, 9, 45, 81, 201, 414, 828, 1650, 3060, 5697, 10131, 17829, 30564, 51543, 85482, 139455, 224527, 356436, 559341, 867405, 1331208, 2022525, 3044331, 4542174, 6720705, 9866794, 14377941, 20804994, 29903823, 42709860, 60631011, 85575855, 120118500, 167716548
Offset: 9
Cf.
A000700,
A001487,
A022604,
A327387,
A338463,
A341228,
A341241,
A341243,
A341244,
A341245,
A341246,
A341247.
-
g:= proc(n) option remember; `if`(n=0, 1, add(add([0, d, -d, d]
[1+irem(d, 4)], d=numtheory[divisors](j))*g(n-j), j=1..n)/n)
end:
b:= proc(n, k) option remember; `if`(k<2, `if`(n=0, 1-k, g(n)),
(q-> add(b(j, q)*b(n-j, k-q), j=0..n))(iquo(k, 2)))
end:
a:= n-> b(n, 9):
seq(a(n), n=9..44); # Alois P. Heinz, Feb 07 2021
-
nmax = 44; CoefficientList[Series[(-1 + Product[1/(1 + (-x)^k), {k, 1, nmax}])^9, {x, 0, nmax}], x] // Drop[#, 9] &
A341370
Expansion of (1 / theta_4(x) - 1)^9 / 512.
Original entry on oeis.org
1, 18, 180, 1311, 7740, 39204, 176388, 721530, 2728053, 9651056, 32246892, 102515508, 311923386, 912771468, 2579132196, 7060677537, 18781247700, 48660380190, 123061973176, 304351869708, 737293187286, 1752035386188, 4089222211212, 9384936015492, 21201250825554
Offset: 9
Cf.
A002448,
A004410,
A014968,
A015128,
A327387,
A338223,
A340946,
A341228,
A341364,
A341365,
A341366,
A341367,
A341368,
A341369.
-
g:= proc(n, i) option remember; `if`(n=0, 1/2, `if`(i=1, 0,
g(n, i-1))+add(2*g(n-i*j, i-1), j=`if`(i=1, n, 1)..n/i))
end:
b:= proc(n, k) option remember; `if`(k=0, 1, `if`(k=1, `if`(n=0, 0,
g(n$2)), (q-> add(b(j, q)*b(n-j, k-q), j=0..n))(iquo(k, 2))))
end:
a:= n-> b(n, 9):
seq(a(n), n=9..33); # Alois P. Heinz, Feb 10 2021
-
nmax = 33; CoefficientList[Series[(1/EllipticTheta[4, 0, x] - 1)^9/512, {x, 0, nmax}], x] // Drop[#, 9] &
nmax = 33; CoefficientList[Series[(1/512) (-1 + Product[(1 + x^k)/(1 - x^k), {k, 1, nmax}])^9, {x, 0, nmax}], x] // Drop[#, 9] &
A341393
Expansion of (-1 + Product_{k>=1} (1 + x^k)^k)^9.
Original entry on oeis.org
1, 18, 189, 1464, 9252, 50292, 243117, 1068939, 4344660, 16522967, 59349627, 202844007, 663615180, 2088375867, 6347592999, 18698498610, 53538715836, 149375490453, 406987481852, 1084906793142, 2834211905622, 7266665613438, 18308976116535
Offset: 9
Cf.
A026007,
A321954,
A327387,
A341384,
A341385,
A341386,
A341387,
A341388,
A341390,
A341391,
A341394.
-
g:= proc(n) option remember; `if`(n=0, 1, add(g(n-j)*add(d^2/
`if`(d::odd, 1, 2), d=numtheory[divisors](j)), j=1..n)/n)
end:
b:= proc(n, k) option remember; `if`(k=0, 1, `if`(k=1, `if`(n=0, 0,
g(n)), (q-> add(b(j, q)*b(n-j, k-q), j=0..n))(iquo(k, 2))))
end:
a:= n-> b(n, 9):
seq(a(n), n=9..31); # Alois P. Heinz, Feb 10 2021
-
nmax = 31; CoefficientList[Series[(-1 + Product[(1 + x^k)^k, {k, 1, nmax}])^9, {x, 0, nmax}], x] // Drop[#, 9] &
Showing 1-5 of 5 results.
Comments