login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A292776
Triangle read by rows: row n gives number of Ramsey partitions of n+k (2 <= k <= n).
0
3, 2, 5, 4, 3, 11, 3, 4, 5, 14, 5, 7, 11, 7, 31, 4, 5, 8, 10, 11, 34, 6, 6, 19, 11, 24, 15, 69, 5, 9, 11, 12, 25, 22, 22, 82, 7, 7, 20, 21, 33, 23, 49, 30, 139
OFFSET
2,1
COMMENTS
See McAvaney et al. for definition of Ramsey partition: If k1 and k2 are positive integers, the partition P = (p1,p2,...,pn) of k1+k2 is said to be a Ramsey partition for the pair k1, k2 if for any sublist L of P, either there is a sublist of L which sums to k1 or a sublist of P -L which sums to k2.
LINKS
Kevin McAvaney, Jack Robertson, and William Webb, Ramsey partitions of integers and fair divisions, Combinatorica 12, pp. 193-201 (1992).
EXAMPLE
Triangle begins:
3;
2, 5;
4, 3, 11;
3, 4, 5, 14;
5, 7, 11, 7, 31;
4, 5, 8, 10, 11, 34;
6, 6, 19, 11, 24, 15, 69;
5, 9, 11, 12, 25, 22, 22, 82;
7, 7, 20, 21, 33, 23, 49, 30, 139;
...
CROSSREFS
Sequence in context: A128076 A076243 A140061 * A061313 A259846 A087669
KEYWORD
nonn,tabl,more
AUTHOR
N. J. A. Sloane, Oct 01 2017
STATUS
approved