The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A258213 Number of permutations of {1,2,3,...,n} such that no even numbers are adjacent. 1
1, 1, 2, 6, 12, 72, 144, 1440, 2880, 43200, 86400, 1814400, 3628800, 101606400, 203212800, 7315660800, 14631321600, 658409472000, 1316818944000, 72425041920000, 144850083840000, 9560105533440000, 19120211066880000, 1491376463216640000, 2982752926433280000 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = factorial(ceiling(n/2))*fallfac(ceiling(n/2)+1, floor(n/2)), with fallfac = A008279.
a(2n) = A010790(n), a(2n-1) = A010790(n)/2.
D-finite with recurrence: (4*(n-2)^2 + 24*n - 80)*a(n) + (16*n+24)*a(n-1) - (n+2)*n*((n-2)^2 + 8*n - 17)*a(n-2) = 0. - Georg Fischer, Nov 23 2022
MAPLE
a:= n-> (m-> m!^2*(m+1))(iquo(n+1, 2, 'r'))/(2-r):
seq(a(n), n=0..24); # Alois P. Heinz, Feb 14 2024
PROG
(PARI) T(n, k) = n!/(n-k)!; \\ A008279
a(n) = ceil(n/2)!*T(ceil(n/2)+1, n\2); \\ Michel Marcus, Nov 24 2022
CROSSREFS
Sequence in context: A090747 A287142 A076220 * A178846 A173843 A107763
KEYWORD
nonn
AUTHOR
Ran Pan, May 23 2015
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 May 16 17:27 EDT 2024. Contains 372554 sequences. (Running on oeis4.)