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!)
A173842 Number of permutations of 1..n with no adjacent pair summing to n+2. 0
1, 1, 2, 2, 12, 48, 336, 1968, 17760, 140160, 1543680, 15298560, 199019520, 2373073920, 35611269120, 496199854080, 8437755432960, 134510244986880, 2556188496691200, 45877376537395200, 963558923688345600, 19225435113632563200, 442230750973683302400 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
If a(n,k) is the number of permutations of 1..n with no adjacent pair summing to n+k, then a(n,k) = a(n,k+1) for n+k even. [proved by William Keith]
LINKS
FORMULA
k = 2; a(n,k) = Sum_{j=0..m} (-2)^j*binomial(m,j)*(n-j)! where m = max(0, floor((n-k+1)/2)). [Max Alekseyev, on the Sequence Fans Mailing List]
CROSSREFS
Sequence in context: A087131 A199240 A349529 * A352526 A131444 A291541
KEYWORD
nonn
AUTHOR
R. H. Hardin, Feb 26 2010
EXTENSIONS
More terms from Alois P. Heinz, Jan 09 2017
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 14 17:50 EDT 2024. Contains 372533 sequences. (Running on oeis4.)