A370363
Number A(n,k) of partitions of [k*n] into n sets of size k having at least one set of consecutive numbers whose maximum (if k>0) is a multiple of k; square array A(n,k), n>=0, k>=0, read by antidiagonals.
Original entry on oeis.org
0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 7, 1, 1, 0, 1, 1, 28, 45, 1, 1, 0, 1, 1, 103, 1063, 401, 1, 1, 0, 1, 1, 376, 22893, 74296, 4355, 1, 1, 0, 1, 1, 1384, 503751, 13080721, 8182855, 56127, 1, 1, 0, 1, 1, 5146, 11432655, 2443061876, 15237712355, 1305232804, 836353, 1, 1
Offset: 0
A(3,2) = 7: 12|34|56, 12|35|46, 12|36|45, 13|24|56, 14|23|56, 15|26|34, 16|25|34.
Square array A(n,k) begins:
0, 0, 0, 0, 0, 0, ...
1, 1, 1, 1, 1, 1, ...
1, 1, 1, 1, 1, 1, ...
1, 1, 7, 28, 103, 376, ...
1, 1, 45, 1063, 22893, 503751, ...
1, 1, 401, 74296, 13080721, 2443061876, ...
-
A:= proc(n, k) option remember; `if`(k=0, signum(n), add(
(-1)^(n-j+1)*binomial(n, j)*(k*j)!/(j!*k!^j), j=0..n-1))
end:
seq(seq(A(n, d-n), n=0..d), d=0..10);
A370357
Number of partitions of [3n] into n sets of size 3 avoiding any set {3j-2,3j-1,3j} (1<=j<=n).
Original entry on oeis.org
1, 0, 9, 252, 14337, 1327104, 182407545, 34906943196, 8877242235393, 2896378850249568, 1179516253790272041, 586470881874514605660, 349649630741370155550849, 246214807676005971547223712, 202182156277565590613022234777, 191496746966087534845272710637564
Offset: 0
a(0) = 1: the empty partition satisfies the condition.
a(1) = 0: 123 is not counted.
a(2) = 9: 124|356, 125|346, 126|345, 134|256, 135|246, 136|245, 145|236, 146|235, 156|234 are counted. 123|456 is not counted.
-
a:= proc(n) option remember; `if`(n<3, [1, 0, 9][n+1],
9*(n*(n-1)/2*a(n-1)+(n-1)^2*a(n-2)+(n-1)*(n-2)/2*a(n-3)))
end:
seq(a(n), n=0..20);
A370368
Total sum over all j in [n] of the number of partitions of [j*(n-j)] into (n-j) sets of size j having no set of consecutive numbers whose maximum (if j>0) is a multiple of j.
Original entry on oeis.org
1, 1, 1, 1, 3, 18, 347, 20679, 4064088, 3206794270, 9817417580226, 147957639234186793, 9515125170594095021483, 3369265619091187775505912588, 5792039079391869138256364232105952, 55416702792637442337898498177490975722265
Offset: 0
-
b:= proc(n, k) `if`(k=0, `if`(n=0, 1, 0), add(
(-1)^(n-j)*binomial(n, j)*(k*j)!/(j!*k!^j), j=0..n))
end:
a:= n-> add(b(j, n-j), j=0..n):
seq(a(n), n=0..15);
A370367
Number of partitions of [n^2] into n sets of size n having no set of consecutive numbers whose maximum (if k>n) is a multiple of n.
Original entry on oeis.org
1, 0, 2, 252, 2604732, 5192229797500, 3708511647508346445685, 1461034020983306348666869275743970, 450538781472323736156501178553451135548626208528, 146413934881756079673947032145931312279368061228255235014292945848
Offset: 0
Showing 1-4 of 4 results.