|
Search: id:A000271
|
|
|
| A000271 |
|
Sums of menage numbers.
(Formerly M3020 N1222)
|
|
+0
8
|
|
| 1, 0, 0, 1, 3, 16, 96, 675, 5413, 48800, 488592, 5379333, 64595975, 840192288, 11767626752, 176574062535, 2825965531593, 48052401132800, 865108807357216, 16439727718351881, 328839946389605643, 6906458590966507696
(list; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
COMMENT
|
Permanent of the (0,1)-matrix having (i,j)-th entry equal to 0 iff this is on the diagonal or the first upper-diagonal. - Simone Severini (ss54(AT)york.ac.uk), Oct 14 2004
|
|
REFERENCES
|
W. Ahrens, Mathematische Unterhaltungen und Spiele. Teubner, Leipzig, Vol. 1, 3rd ed., 1921; Vol. 2, 2nd ed., 1918. See Vol. 2, p. 79.
J. D. H. Dickson, Discussion of two double series arising from the number of terms in determinants of certain forms, Proc. London Math. Soc., 10 (1879), 120-122.
J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 198.
H. M. Taylor, A problem on arrangements, Mess. Math., 32 (1902), 60ff.
M. Wyman and L. Moser, On the probleme des menages, Canad. J. Math., 10 (1958), 468-480.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..100
W. Ahrens, Mathematische Unterhaltungen und Spiele, Leipzig: B. G. Teubner, 1901.
|
|
FORMULA
|
a(n) = (n - 1) a(n - 2) + (n - 1) a(n - 1) + a(n - 3).
|
|
MAPLE
|
V := proc(n) local k; add( binomial(2*n-k, k)*(n-k)!*(x-1)^k, k=0..n); end; W := proc(r, s) coeff( V(r), x, s ); end; A000271 := n->W(n-2, 0);
|
|
CROSSREFS
|
Cf. A000179. A diagonal of A058057.
Sequence in context: A114174 A006347 A000270 this_sequence A074553 A091641 A137572
Adjacent sequences: A000268 A000269 A000270 this_sequence A000272 A000273 A000274
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Aug 21 2000
More terms from Simone Severini (ss54(AT)york.ac.uk), Oct 14 2004
|
|
|
Search completed in 0.002 seconds
|
