login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A370324
Number of derangements of [n] having no adjacent 2-cycles, no adjacent 3-cycles, no adjacent 4-cycles and no adjacent 5-cycles.
3
1, 0, 0, 1, 6, 34, 217, 1567, 12842, 117704, 1193802, 13280778, 160843345, 2107036346, 29689965966, 447822830067, 7199604972876, 122907451783308, 2220526880775841, 42328779624824103, 849065324387063412, 17877539166289948864, 394246737752465047380
OFFSET
0,5
FORMULA
G.f.: Sum_{k>=0} k! * x^k * ( (1-x)/(1-x^6) )^(k+1).
a(n) = Sum_{i, j, k, l, m>=0 and i+2*j+3*k+4*l+5*m<=n} (-1)^(i+j+k+l+m) * (n-j-2*k-3*l-4*m)!/(i!*j!*k!*l!*m!).
PROG
(PARI) my(N=30, x='x+O('x^N)); Vec(sum(k=0, N, k!*x^k*((1-x)/(1-x^6))^(k+1)))
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Feb 22 2024
STATUS
approved