A144508 -id:A144508 - cp's OEIS frontend

A144512 Array read by upwards antidiagonals: T(n,k) = total number of partitions of [1, 2, ..., k] into exactly n blocks, each of size 1, 2, ..., k+1, for 0 <= k <= (k+1)*n.

1, 1, 1, 1, 2, 1, 1, 3, 7, 1, 1, 4, 31, 37, 1, 1, 5, 121, 842, 266, 1, 1, 6, 456, 18252, 45296, 2431, 1, 1, 7, 1709, 405408, 7958726, 4061871, 27007, 1, 1, 8, 6427, 9268549, 1495388159, 7528988476, 546809243, 353522, 1, 1, 9, 24301, 216864652, 295887993624, 15467641899285

Offset: 0

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

			Array begins:
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...
1, 2, 7, 37, 266, 2431, 27007, 353522, 5329837, ...
1, 3, 31, 842, 45296, 4061871, 546809243, 103123135501, ...
1, 4, 121, 18252, 7958726, 7528988476, 13130817809439, ...
1, 5, 456, 405408, 1495388159, 15467641899285, 361207016885536095, ...
1, 6, 1709, 9268549, 295887993624, 34155922905682979, 10893033763705794846727, ...
...

Moa Apagodu, David Applegate, N. J. A. Sloane, and Doron Zeilberger, Analysis of the Gift Exchange Problem, arXiv:1701.08394, 2017.
David Applegate and N. J. A. Sloane, The Gift Exchange Problem (arXiv:0907.0513, 2009)

See A144510 for Maple code.
Rows include A001515, A144416, A144508, A144509, A149187.
Columns include A048775, A144511, A144662, A147984.
Transpose of array in A144510.
Main diagonal gives A281901.

b := proc(n, i, k) local r;
option remember;
if n = i then 1;
elif i < n then 0;
elif n < 1 then 0;
else add( binomial(i-1,r)*b(n-1,i-1-r,k), r=0..k);
end if;
end proc;
T:=proc(n,k); add(b(n,i,k),i=0..(k+1)*n); end proc;

multinomial[n_, k_List] := n!/Times @@ (k!); t[n_, k_] := Module[{i, ik}, ik = Array[i, k]; 1/k!* Sum[multinomial[Total[ik], ik], Evaluate[Sequence @@ Thread[{ik, 1, n}]]]]; Table[t[n-k, k], {n, 1, 10}, {k, 0, n-1}] // Flatten (* Jean-François Alcover, Jan 14 2014 *)

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.

Original entry on oeis.org

1, 2, 31, 18252, 1495388159, 34155922905682979, 350521520018942991464535019, 2371013832433361706367594400829713564440, 14584126149704606223764458141727351569547933381159988406, 107640669875812795238625627484701500354901860426640161278022882392148747562

Offset: 0

Alois P. Heinz, Feb 01 2017

nonn

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.

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.

Main diagonal of A144510, A144512.

Cf. A001515, A144416, A144508, A144509, A149187, A281358, A281359, A281360, A281361.

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);

multinomial[n_, k_List] := n!/Times @@ (k!); b[n_, i_, t_] := b[n, i, t] = If[t*iJean-François Alcover, Mar 13 2017, translated from Maple *)

a(n) = A144510(n+1,n) = A144512(n,n).

A308389 a(n) = (1/n!) * Sum_{i_1=1..4} Sum_{i_2=1..4} ... Sum_{i_n=1..4} (-1)^(i_1 + i_2 + ... + i_n) * multinomial(i_1 + i_2 + ... + i_n; i_1, i_2, ..., i_n).

Original entry on oeis.org

1, 0, 15, 2380, 1056496, 1006985994, 1762986495425, 5113595093793395, 22839265373518360690, 148735602883834110187329, 1353820891564948063221216616, 16652183007514287292261315076600, 269267286009015985660399792630965620, 5594310615550213586375706097295466365365

Offset: 0

Seiichi Manyama, May 23 2019

nonn

Row n=4 of A308356.

Cf. A144508.

{a(n) = sum(i=n, 4*n, (-1)^i*i!*polcoef(sum(j=1, 4, x^j/j!)^n, i))/n!}

cp's OEIS Frontend

A144512 Array read by upwards antidiagonals: T(n,k) = total number of partitions of [1, 2, ..., k] into exactly n blocks, each of size 1, 2, ..., k+1, for 0 <= k <= (k+1)*n.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

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.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A308389 a(n) = (1/n!) * Sum_{i_1=1..4} Sum_{i_2=1..4} ... Sum_{i_n=1..4} (-1)^(i_1 + i_2 + ... + i_n) * multinomial(i_1 + i_2 + ... + i_n; i_1, i_2, ..., i_n).

Views

Author

Keywords

Crossrefs

Programs

PARI