login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A370530 Number of permutations of [n] having exactly three adjacent 3-cycles. 4
0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 4, 20, 116, 820, 6600, 59650, 598140, 6592740, 79232140, 1031214100, 14450182880, 216911207555, 3472641749080, 59063810100120, 1063582404217144, 20215010963623896, 404418346892678160, 8494912449554675844, 186928503912130116360 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,11
LINKS
R. A. Brualdi and Emeric Deutsch, Adjacent q-cycles in permutations, arXiv:1005.0781 [math.CO], 2010.
FORMULA
G.f.: (1/6) * Sum_{k>=3} k! * x^(k+6) / (1+x^3)^(k+1).
a(n) = (1/6) * Sum_{k=0..floor(n/3)-3} (-1)^k * (n-2*k-6)! / k!.
PROG
(PARI) my(N=30, x='x+O('x^N)); concat([0, 0, 0, 0, 0, 0, 0, 0, 0], Vec(sum(k=3, N, k!*x^(k+6)/(1+x^3)^(k+1))/6))
(PARI) a(n, k=3, q=3) = sum(j=0, n\q-k, (-1)^j*(n-(q-1)*(j+k))!/j!)/k!;
CROSSREFS
Column k=3 of A177250.
Sequence in context: A078944 A158900 A190194 * A127088 A258666 A128236
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Feb 21 2024
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 29 08:49 EDT 2024. Contains 372098 sequences. (Running on oeis4.)