|
Search: id:A054225
|
|
|
| A054225 |
|
Table of partitions of pairs. |
|
+0
3
|
|
| 1, 1, 1, 2, 2, 2, 3, 4, 4, 3, 5, 7, 8, 7, 5, 7, 12, 15, 15, 12, 7, 11, 19, 26, 28, 26, 19, 11, 15, 30, 43, 49, 49, 43, 30, 15, 22, 45, 69, 81, 86, 81, 69, 45, 22, 30, 67, 107, 130, 143, 143, 130, 107, 67, 30, 42, 97, 163, 203, 231, 236, 231, 203, 163, 97, 42, 56, 139, 242, 311
(list; table; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
Parts (i,j) are "positive" in the sense that min i,j >= 0 and max i,j >0. The empty partition of (0,0) is counted as 1.
|
|
EXAMPLE
|
a(2,1)=4 from (2,1) (2,0)+(0,1) (1,0)+(1,1) (1,0)+(1,0)+(0,1)
|
|
CROSSREFS
|
A054242 gives partitions into distinct pairs.
Sequence in context: A000224 A085201 A051601 this_sequence A074829 A060243 A091822
Adjacent sequences: A054222 A054223 A054224 this_sequence A054226 A054227 A054228
|
|
KEYWORD
|
easy,nonn,tabl,nice
|
|
AUTHOR
|
Marc LeBrun (mlb(AT)well.com), Feb 04 2000
|
|
|
Search completed in 0.002 seconds
|
