login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A212805 (1-(n-1)/2^n)*(n!)^n. 1
2, 1, 3, 162, 269568, 21772800000, 128430157824000000, 78734235726376796160000000, 6793969131008738346811156070400000000, 107405833909078014660339510303458240495616000000000, 392460917103771065568880570648836410770980864000000000000000000000, 407931390497527236736237611020825246476822200409679741237329920000000000000000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

REFERENCES

Abramson, Morton; Promislow, David. Enumeration of arrays by column rises. J. Combinatorial Theory Ser. A 24 (1978), no. 2, 247--250. MR0469773 (57 #9554)

LINKS

Table of n, a(n) for n=0..11.

CROSSREFS

Cf. A212806.

Sequence in context: A126008 A096098 A096097 * A246431 A225777 A016585

Adjacent sequences:  A212802 A212803 A212804 * A212806 A212807 A212808

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, May 27 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 19 16:10 EST 2017. Contains 294936 sequences.