|
Search: id:A144399
|
|
| |
|
| 1, 1, 1, 1, 1, 3, 7, 10, 10, 1, 6, 25, 75, 175, 280, 280, 1, 10, 65, 315, 1225, 3780, 9100, 15400, 15400, 1, 15, 140, 980, 5565, 26145, 102025, 323400, 800800, 1401400, 1401400, 1, 21, 266, 2520, 19425, 125895, 695695, 3273270, 12962950
(list; graph; listen)
|
|
|
OFFSET
|
0,6
|
|
|
COMMENT
|
Row n has 2n+1 terms.
|
|
LINKS
|
David Applegate and N. J. A. Sloane, The Gift Exchange Problem (arXiv:0907.0513, 2009)
|
|
EXAMPLE
|
Triangle begins:
1
1, 1, 1
1, 3, 7, 10, 10
1, 6, 25, 75, 175, 280, 280
1, 10, 65, 315, 1225, 3780, 9100, 15400, 15400
|
|
CROSSREFS
|
Cf. A144385. Row sums give A144416.
Sequence in context: A112105 A065501 A144385 this_sequence A138935 A030325 A095947
Adjacent sequences: A144396 A144397 A144398 this_sequence A144400 A144401 A144402
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
David Applegate and N. J. A. Sloane (njas(AT)research.att.com), Dec 07 2008
|
|
|
Search completed in 0.002 seconds
|
