|
Search: id:A054242
|
|
|
| A054242 |
|
Table of partitions of pairs into distinct pairs. |
|
+0
2
|
|
| 1, 1, 1, 1, 2, 1, 2, 3, 3, 2, 2, 5, 6, 5, 2, 3, 7, 10, 10, 7, 3, 4, 10, 15, 16, 15, 10, 4, 5, 14, 21, 25, 25, 21, 14, 5, 6, 19, 29, 35, 40, 35, 29, 19, 6, 8, 25, 39, 50, 57, 57, 50, 39, 25, 8, 10, 33, 51, 68, 82, 82, 82, 68, 51, 33, 10, 12, 43, 66, 92, 112, 120, 120, 112, 92, 66, 43
(list; table; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
COMMENT
|
By analogy with regular partitions. Empty partition of a(0,0)=1 by definition. A054225 gives pair partitions with repeats allowed
|
|
EXAMPLE
|
a(1,3)=5 thus: (1,3) (0,3)+(1,0) (0,2)+(1,1) (0,2)+(0,1)+(1,0) (0,1)+(1,2)
|
|
CROSSREFS
|
Cf. A054225.
Adjacent sequences: A054239 A054240 A054241 this_sequence A054243 A054244 A054245
Sequence in context: A058063 A143902 A085472 this_sequence A033767 A033775 A033791
|
|
KEYWORD
|
easy,nonn,tabl
|
|
AUTHOR
|
Marc LeBrun (mlb(AT)well.com), Feb 08 2000
|
|
|
Search completed in 0.002 seconds
|
