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!)
A144509 a(n) = total number of partitions of [1, 2, ..., k] into exactly n blocks, each of size 1, 2, ..., 5, for 0 <= k <= 5n. 13
1, 5, 456, 405408, 1495388159, 15467641899285, 361207016885536095, 16557834064546698285496, 1350410785161120363519024709, 182141025850694258874753732988078, 38395944834298393218465758049745918098, 12093097322244029427838390643054170162054258, 5485321312184901565806045962453632525844948020084 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Also, number of scenarios in the Gift Exchange Game when a gift can be stolen at most 4 times. - N. J. A. Sloane, Jan 25 2017

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..100

Moa Apagodu, David Applegate, N. J. A. Sloane, and Doron Zeilberger, Analysis of the Gift Exchange Problem, arXiv:1701.08394 [math.CO], 2017.

Moa Apagodu, David Applegate, N. J. A. Sloane, and Doron Zeilberger, On-Line Appendix I to "Analysis of the gift exchange problem", giving Type D recurrences for G_1(n) through G_15(n) (see A001515, A144416, A144508, A144509, A149187, A281358-A281361)

Moa Apagodu, David Applegate, N. J. A. Sloane, and Doron Zeilberger, On-Line Appendix II to "Analysis of the gift exchange problem", giving Type C recurrences for G_1(n) through G_15(n) (see A001515, A144416, A144508, A144509, A149187, A281358-A281361)

David Applegate and N. J. A. Sloane, The Gift Exchange Problem, arXiv:0907.0513 [math.CO], 2009.

MATHEMATICA

t[n_, n_] = 1; t[n_ /; n >= 0, k_] /; 0 <= k <= 5*n := t[n, k] = Sum[(1/j!)*Product[k - m, {m, 1, j}]*t[n - 1, k - j - 1], {j, 0, 4}]; t[_, _] = 0; a[n_] := Sum[t[n, k], {k, 0, 5*n}]; Table[a[n], {n, 0, 15}] (* Jean-Fran├žois Alcover, Feb 18 2017 *)

PROG

(PARI) {a(n) = sum(i=n, 5*n, i!*polcoef(sum(j=1, 5, x^j/j!)^n, i))/n!} \\ Seiichi Manyama, May 22 2019

CROSSREFS

The gift scenarios sequences when a gift can be stolen at most s times, for s = 1..9, are A001515, A144416, A144508, A144509, A149187, A281358, A281359, A281360, A281361.

Sequence in context: A300928 A221626 A332145 * A240700 A060855 A212043

Adjacent sequences:  A144506 A144507 A144508 * A144510 A144511 A144512

KEYWORD

nonn

AUTHOR

David Applegate and N. J. A. Sloane, Dec 15 2008

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 September 21 04:10 EDT 2021. Contains 347596 sequences. (Running on oeis4.)