The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A194621 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A194621

Triangle T(n,k), n>=0, 0<=k<=n, read by rows: T(n,k) is the number of partitions of n in which any two parts differ by at most k.
(history; published version)

#24 by Alois P. Heinz at Fri Sep 07 14:53:28 EDT 2018

STATUS

editing

approved

#23 by Alois P. Heinz at Fri Sep 07 14:53:26 EDT 2018

EXAMPLE

1;

1, 1;

2, 2, 2;

2, 3, 3, 3;

3, 4, 5, 5, 5;

2, 5, 6, 7, 7, 7;

4, 6, 9, 10, 11, 11, 11;

2, 7, 10, 13, 14, 15, 15, 15;

CROSSREFS

Diagonal Main diagonal gives: A000041.

STATUS

approved

editing

#22 by N. J. A. Sloane at Thu Sep 06 22:29:25 EDT 2018

STATUS

editing

approved

#21 by N. J. A. Sloane at Thu Sep 06 22:29:21 EDT 2018

LINKS

C. Ji, <a href="https://arxiv.org/abs/1608.06025">Enumerative Properties of Posets Corresponding to a Certain Class of No Strategy Games</a>, arXiv:1608.06025 [math.CO], 2016

STATUS

approved

editing

#20 by N. J. A. Sloane at Wed Aug 09 05:54:11 EDT 2017

STATUS

editing

approved

#19 by N. J. A. Sloane at Wed Aug 09 05:54:08 EDT 2017

LINKS

C. Ji, <a href="https://arxiv.org/abs/1608.06025">Enumerative Properties of Posets Corresponding to a Certain Class of No Strategy Games</a>, arXiv:1608.06025 [math.CO], 2016

STATUS

approved

editing

#18 by Alois P. Heinz at Tue Dec 23 18:05:57 EST 2014

STATUS

editing

approved

#17 by Alois P. Heinz at Tue Dec 23 18:05:54 EST 2014

MAPLE

T:= (n, k)-> `if` (n=0, 1, 0) +add (b(n-i, i, k), i=1..n):

seq (seq (T(n, k), k=0..n), n=0..20);

STATUS

approved

editing

#16 by Bruno Berselli at Mon Dec 09 09:32:24 EST 2013

STATUS

proposed

approved

#15 by Jean-François Alcover at Mon Dec 09 08:31:01 EST 2013

STATUS

editing

proposed