|
Search: id:A008305
|
|
|
| A008305 |
|
Triangle read by rows: a(n,k) = number of permutations of [ n ] allowing i->i+j (mod n),j=0..k-1. |
|
+0
4
|
|
| 1, 1, 2, 1, 2, 6, 1, 2, 9, 24, 1, 2, 13, 44, 120, 1, 2, 20, 80, 265, 720, 1, 2, 31, 144, 579, 1854, 5040, 1, 2, 49, 264, 1265, 4738, 14833, 40320, 1, 2, 78, 484, 2783, 12072, 43387, 133496, 362880, 1, 2, 125, 888, 6208, 30818, 126565, 439792, 1334961, 3628800, 1, 2
(list; table; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
N. S. Mendelsohn, Permutations with restricted displacement, Canad. Math. Bull., 4 (1961), 29-38.
H. Minc, Permanents, Encyc. Math. #6, 1978, p. 48
|
|
FORMULA
|
a(n, k)=per(sum(P^j, j=0..k-1)), where P is n by n, P[ i, i+1 (mod n) ]=1, 0's otherwise.
|
|
EXAMPLE
|
1; 1,2; 1,2,6; 1,2,9,24; etc. (so a(4,3)=9)
|
|
CROSSREFS
|
A000142, A000166, A000179, A000183, A004307, A000211, A000496, A000803, A004306.
Cf. A000804, A000805.
Adjacent sequences: A008302 A008303 A008304 this_sequence A008306 A008307 A008308
Sequence in context: A083773 A096179 A133643 this_sequence A133644 A143965 A098361
|
|
KEYWORD
|
tabl,nonn
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
Comments and more terms from Len Smiley (smiley(AT)math.uaa.alaska.edu)
More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Oct 02 2003
|
|
|
Search completed in 0.002 seconds
|
