This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A281901 Number of scenarios in the Gift Exchange Game with n players and n wrapped gifts when a gift can be stolen at most n times. 4
 1, 2, 31, 18252, 1495388159, 34155922905682979, 350521520018942991464535019, 2371013832433361706367594400829713564440, 14584126149704606223764458141727351569547933381159988406, 107640669875812795238625627484701500354901860426640161278022882392148747562 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Also total number of partitions of [k] into exactly n nonempty blocks, each of size at most n+1, for any k in the range n <= k <= n^2+n . LINKS Alois P. Heinz, Table of n, a(n) for n = 0..26 Moa Apagodu, David Applegate, N. J. A. Sloane, and Doron Zeilberger, Analysis of the Gift Exchange Problem, arXiv:1701.08394, 2017. Moa Apagodu, David Applegate, N. J. A. Sloane, and Doron Zeilberger, On-Line Appendix I to "Analysis of the gift exchange problem" Moa Apagodu, David Applegate, N. J. A. Sloane, and Doron Zeilberger, On-Line Appendix II to "Analysis of the gift exchange problem" David Applegate and N. J. A. Sloane, The Gift Exchange Problem (arXiv:0907.0513 [math.CO], 2009 FORMULA a(n) = A144510(n+1,n) = A144512(n,n). MAPLE with(combinat): b:= proc(n, i, t) option remember; `if`(t*i add(b(j, n+1, n), j=0..(n+1)*n): seq(a(n), n=0..10); MATHEMATICA multinomial[n_, k_List] := n!/Times @@ (k!); b[n_, i_, t_] := b[n, i, t] = If[t*i

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.

Last modified August 21 23:00 EDT 2019. Contains 326169 sequences. (Running on oeis4.)