|
Search: id:A000442
|
|
| |
|
| 1, 1, 8, 216, 13824, 1728000, 373248000, 128024064000, 65548320768000, 47784725839872000, 47784725839872000000, 63601470092869632000000, 109903340320478724096000000, 241457638684091756838912000000
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Permanent of upper right n X n corner of multiplication table (A003991) - Marc LeBrun (mlb(AT)well.com), Dec 11 2003
a(n) = number of set partitions of {1,2,...,4n-1,4n} into blocks of size 4 in which the entries of each block mod 4 are distinct. For example, a(2) = 8 counts 1234-5678, 1678-2345, 1278-3456, 1346-2578, 1238-4567, 1467-2358, 1247-3568, 1368-2457. - David Callan (callan(AT)stat.wisc.edu), Mar 30 2007
|
|
REFERENCES
|
F. Smarandache, "Properties of the Numbers", University of Craiova Archives, 1975; Arizona State University Special Collections, Tempe, AZ
Kazandzidis, G.S.; On a Conjecture of Moessner and a General Problem, Bull. Soc. Math. Grece, Nouvelle Serie - vol. 2, fasc. 1-2, pp. 23-30.(1961)
|
|
LINKS
|
M. L. Perez et al., eds., Smarandache Notions Journal
|
|
MATHEMATICA
|
Table[(n!)^3, {n, 0, 20}] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Apr 14 2006
|
|
CROSSREFS
|
Cf. A003991.
Sequence in context: A002897 A024289 A009106 this_sequence A115964 A055350 A006919
Adjacent sequences: A000439 A000440 A000441 this_sequence A000443 A000444 A000445
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
R. Muller
|
|
|
Search completed in 0.002 seconds
|
