A372545
Number of permutations of [n] such that the number of cycles of length k is a multiple or a divisor of k for every k.
Original entry on oeis.org
1, 1, 2, 6, 24, 120, 665, 4655, 37660, 345660, 3373629, 37109919, 443171498, 5761229474, 79709485141, 1199252731963, 19237203662248, 327101074802216, 5848216651372953, 111064609625430747, 2222478622302320382, 46709011248199791062, 1022898268873467547769
Offset: 0
a(6) = 665 = 720 - 55 counts all permutations of [6] with the exception of 15 permutations of type (12)(34)(56) and 40 permutations of type (123)(456).
-
b:= proc(n, i) option remember; `if`(n=0 or i=1, 1, add(`if`(
irem(j, i)=0 or irem(i, j)=0, b(n-i*j, i-1)*(i-1)!^j/j!
*combinat[multinomial](n, i$j, n-i*j), 0), j=0..n/i))
end:
a:= n-> b(n$2):
seq(a(n), n=0..25);
A374262
Number of permutations of [n] such that the number of cycles of length k is a multiple of k for every k.
Original entry on oeis.org
1, 1, 1, 1, 4, 16, 46, 106, 316, 3564, 27756, 141516, 556656, 6678816, 73015944, 521124696, 6144018336, 75200767776, 677927254176, 4642387894944, 75217104395136, 1167068528384256, 12348761954020416, 97377968145352896, 882819252604721664, 66882151986021043200
Offset: 0
a(4) = 4: (1)(2)(3)(4), (1,2)(3,4), (1,3)(2,4), (1,4)(2,3).
-
b:= proc(n, i) option remember; `if`(n=0 or i=1, 1,
add(combinat[multinomial](n, i$i*j, n-i^2*j)*
b(n-i^2*j, i-1)*(i-1)!^(i*j)/(i*j)!, j=0..n/i^2))
end:
a:= n-> b(n$2):
seq(a(n), n=0..25);
A374292
Number of permutations of [n] such that the number of cycles of length k is zero or a divisor of k for every k.
Original entry on oeis.org
1, 1, 1, 5, 17, 89, 474, 3324, 28440, 253448, 2476700, 26876420, 328110540, 4207321260, 58468831680, 877439227560, 14214209548560, 239870470655760, 4285924637475600, 81381169697904720, 1636049164466934000, 34301061146870607600, 750389221227585139200
Offset: 0
a(3) = 5: (1)(2,3), (1,2)(3), (1,3)(2), (1,2,3), (1,3,2).
-
b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,
add(`if`(j=0 or irem(i, j)=0, b(n-i*j, i-1)*(i-1)!^j/j!*
combinat[multinomial](n, i$j, n-i*j), 0), j=0..n/i)))
end:
a:= n-> b(n$2):
seq(a(n), n=0..25);
A374321
Number of partitions of [n] such that the number of blocks of size k is zero or equals k for every k.
Original entry on oeis.org
1, 1, 0, 0, 3, 15, 0, 0, 0, 280, 2800, 0, 0, 600600, 8408400, 0, 2627625, 44669625, 0, 0, 38192529375, 802043116875, 0, 0, 0, 1508282884484376, 39215354996593776, 0, 0, 107469680368165243128, 3224090411044957293840, 0, 0, 0, 76290792475347121351680
Offset: 0
a(0) = 1: the empty partition.
a(1) = 1: 1.
a(4) = 3: 12|34, 13|24, 14|23.
a(5) = 15: 12|34|5, 12|35|4, 12|3|45, 13|24|5, 13|25|4, 13|2|45, 14|23|5, 15|23|4, 1|23|45, 14|25|3, 14|2|35, 15|24|3, 1|24|35, 15|2|34, 1|25|34.
a(9) = 280: 123|456|789, 123|457|689, 123|458|679, 123|459|678, ..., 169|278|345, 178|269|345, 179|268|345, 189|267|345.
-
b:= proc(n, i) option remember; `if`(n=0, 1,
`if`(i<1, 0, add(`if`(j=0 or j=i, b(n-i*j, i-1)/j!*
combinat[multinomial](n, i$j, n-i*j), 0), j=0..n/i)))
end:
a:= n-> b(n$2):
seq(a(n), n=0..35);
Showing 1-4 of 4 results.