login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110017 Number of games that can be played with a set of 4n cards. 0
1, 38, 17370, 31532760, 152770174200, 1623335272297200, 33237789624004165200, 1195230914866984819824000, 70405077040237339921593072000, 6434319990707289925222982683680000, 873465373058505314477955434719930080000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

J. P. Delahaye and P. Mathieu, La bataille, enfin analysee, in Pour la Science, pp. 101 No. 215 September 1995 Paris.

LINKS

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

FORMULA

a(n) = {(4n)!/(4!)^n + (2n)!/(2!)^n}/2.

PROG

(PARI) a(n) = ((4*n)!/24^n + (2*n)!/2^n)/2 \\ Charles R Greathouse IV, Sep 06 2016

CROSSREFS

Sequence in context: A030260 A145122 A134182 * A181016 A103479 A036174

Adjacent sequences:  A110014 A110015 A110016 * A110018 A110019 A110020

KEYWORD

fini,full,nonn,easy

AUTHOR

Lekraj Beedassy, Sep 03 2005

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 25 20:04 EST 2020. Contains 332258 sequences. (Running on oeis4.)