|
Search: id:A110128
|
|
|
| A110128 |
|
Number of permutations p of 12..n satisfying |p(i+2)-p(i)| not equal to 2 for all 0<i<n-1. |
|
+0
4
|
|
| 1, 1, 2, 4, 16, 44, 200, 1288, 9512, 78652, 744360, 7867148, 91310696, 1154292796, 15784573160, 232050062524, 3648471927912, 61080818510972, 1084657970877416, 20361216987032284, 402839381030339816, 8377409956454452732
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
When n is even: 1) Number of ways that n persons seated at a rectangular table with n/2 seats along the two opposite sides can be rearranged in such a way that neighbors are no more neighbors after the rearrangement. 2) Number of ways to arrange n kings on an n X n board, with 1 in each row and column, which are non-attacking with respect to the main four quadrants.
|
|
REFERENCES
|
Roberto Tauraso, The Dinner Table Problem: The Rectangular Case, INTEGERS, vol. 6 (2006), paper A11
|
|
LINKS
|
Roberto Tauraso, The Dinner Table Problem: The Rectangular Case
|
|
FORMULA
|
A formula is given in the Tauraso reference
|
|
CROSSREFS
|
Cf. A089222, A002464.
Sequence in context: A048222 A062330 A133465 this_sequence A101061 A112638 A077162
Adjacent sequences: A110125 A110126 A110127 this_sequence A110129 A110130 A110131
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
R. Tauraso, A. Nicolosi and G. Minenkov (tauraso(AT)mat.uniroma2.it), Jul 13 2005
|
|
EXTENSIONS
|
Edited by njas at the suggestion of Vladeta Jovovic, Jan 01 2008
|
|
|
Search completed in 0.002 seconds
|
