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!)
A370570 Number of permutations of [n] having no adjacent 2-cycles and no adjacent 3-cycles. 0
1, 1, 1, 3, 17, 95, 594, 4280, 35018, 320636, 3249951, 36140133, 437572800, 5731086422, 80745062993, 1217782176949, 19576722067015, 334183547442139, 6037316140379389, 115082343658784617, 2308352556410956084, 48602560660569621128, 1071794851776260190000 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
FORMULA
G.f.: Sum_{k>=0} k! * x^k / (1+x^2+x^3)^(k+1).
a(n) = Sum_{i, j>=0 and 2*i+3*j<=n} (-1)^(i+j) * (n-i-2*j)!/(i!*j!).
PROG
(PARI) my(N=30, x='x+O('x^N)); Vec(sum(k=0, N, k!*x^k/(1+x^2+x^3)^(k+1)))
CROSSREFS
Cf. A370569.
Sequence in context: A020056 A086842 A151330 * A302871 A010913 A142988
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Feb 22 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 August 12 06:37 EDT 2024. Contains 375085 sequences. (Running on oeis4.)