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!)
A173847 Number of permutations of 1..n with no adjacent pair summing to n+7. 0
1, 1, 2, 6, 24, 120, 720, 5040, 30240, 282240, 2338560, 26853120, 280143360, 3802982400, 47638886400, 745007155200, 10872058982400, 192275074252800, 3200021920972800, 63107717389516800, 1178953777845043200, 25641537378199142400, 531103116540719923200 (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.
LINKS
FORMULA
k = 7; m = max(0,floor((n-k+1)/2)); a(n,k) = Sum_{j=0..m} (-2)^j C(m,j) (n-j)!.
CROSSREFS
Sequence in context: A138113 A045977 A177278 * A154655 A256181 A293784
KEYWORD
nonn
AUTHOR
R. H. Hardin, Feb 26 2010, comment proved by William J. Keith, formula from Max Alekseyev, on the Sequence Fans Mailing List
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 March 28 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)