|
Search: id:A049430
|
|
|
| A049430 |
|
Triangle T(n,d) = number of distinct d-dimensional polyominoes (or polycubes) with n cells (n >= 1,d>=0). |
|
+0
4
|
|
| 1, 0, 1, 0, 1, 1, 0, 1, 4, 2, 0, 1, 11, 11, 3, 0, 1, 34, 77, 35, 6, 0, 1, 107, 499, 412, 104, 11, 0, 1, 368, 3442, 4888, 2009, 319, 23, 0, 1, 1284, 24128, 57122, 36585, 8869, 951, 47
(list; table; graph; listen)
|
|
|
OFFSET
|
1,9
|
|
|
EXAMPLE
|
1; 0,1; 0,1,1; 0,1,4,2; 0,1,11,11,3; ...
|
|
CROSSREFS
|
Cf. A049429. Row sums give A005519.
Sequence in context: A021242 A088393 A121225 this_sequence A055356 A164789 A028956
Adjacent sequences: A049427 A049428 A049429 this_sequence A049431 A049432 A049433
|
|
KEYWORD
|
nonn,nice,tabl,hard
|
|
AUTHOR
|
Richard Schroeppel (rcs(AT)cheltenham.CS.Arizona.EDU)
|
|
|
Search completed in 0.002 seconds
|
