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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A144662 a(n) = Sum_{i=1..n} Sum_{j=1..n} Sum_{k=1..n} Sum_{l=1..n} (i+j+k+l)!/(4!*i!*j!*k!*l!). 3
0, 1, 266, 45296, 7958726, 1495388159, 295887993624, 60790021361170, 12845435390707724, 2774049143394729653, 609542744597785306189, 135840016223787254538508, 30629983532857972983331740, 6975352854342057056747327899, 1602003695575764851150428242804, 370631496919828403109950449644134 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

LINKS

David Applegate and N. J. A. Sloane, The Gift Exchange Problem (arXiv:0907.0513, 2009)

MAPLE

f:=n->add( add( add( add( (i+j+k+l)!/(4!*i!*j!*k!*l!), i=1..n), j=1..n), k=1..n), l=1..n); [seq(f(n), n=0..16)];

CROSSREFS

Column 4 of A144512. Cf. A144660. A144661.

Sequence in context: A028528 A205229 A028523 * A060402 A049014 A186056

Adjacent sequences:  A144659 A144660 A144661 * A144663 A144664 A144665

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Feb 01 2009

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

Content is available under The OEIS End-User License Agreement .

Last modified February 16 04:47 EST 2012. Contains 205860 sequences.