|
| |
|
|
A000536
|
|
Number of 3-line Latin rectangles.
(Formerly M5152 N2236)
|
|
0
| |
|
|
24, 240, 2520, 26880, 304080, 3671136, 47391120, 653463360, 9603708840, 150046937040, 2485510331304, 43536519673920, 804343214307360, 15636586027419840, 319143375070100640, 6824486562845878656, 152599994618389811640, 3561710724832153990320, 86627571138529803385080, 2192153071078356814538880, 57633178354598014299807984, 1572073330365520093029415200, 44434609885866805678475703600, 1299879247128621094998213278400, 39312834919322919649653205283400, 1227895179113516869799082638629776, 39569125440836907870479047149487560, 1314368274045259508166257769617810880, 44963797526832537006635800892057862720, 1582832153412276057834241761650127323520
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 4,1
|
|
|
REFERENCES
| J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 210.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
| Index entries for sequences related to Latin squares and rectangles
|
|
|
FORMULA
| Let K(0,0)=1; K(n,0)=n*K(n-1,0)+(-1)^n, n>0; and j*K(n,j)=n*(n+1-2*j)*K(n-1,j-1)+n*(n-1)*K(n-2,j-1), j>0. Sequence is a(n)=K(n,2).
|
|
|
CROSSREFS
| Sequence in context: A052753 A052520 A052724 * A151720 A052652 A052732
Adjacent sequences: A000533 A000534 A000535 * A000537 A000538 A000539
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
EXTENSIONS
| More terms and formula from Sean A. Irvine (sairvin(AT)xtra.co.nz), Nov 15 2010
|
| |
|
|
