|
| |
|
|
A049430
|
|
Triangle read by rows: T(n,d) = number of distinct properly d-dimensional polyominoes (or polycubes) with n cells (n >= 1,d>=0).
|
|
10
| |
|
|
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; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,9
|
|
|
REFERENCES
| W. F. Lunnon, Counting multidimensional polyominoes. Computer Journal 18 (1975), no. 4, pp. 366-367.
|
|
|
EXAMPLE
| Triangle begins:
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
...
|
|
|
CROSSREFS
| Cf. A049429, A195738, A195739. Row sums give A005519. Columns give A006765, A006766, A006767, A006768.
Sequence in context: A021242 A088393 A121225 * A055356 A164789 A028956
Adjacent sequences: A049427 A049428 A049429 * A049431 A049432 A049433
|
|
|
KEYWORD
| nonn,nice,tabl,hard,more
|
|
|
AUTHOR
| Richard Schroeppel (rcs(AT)cheltenham.CS.Arizona.EDU)
|
|
|
EXTENSIONS
| Edited by N. J. A. Sloane, Sep 23 2011.
|
| |
|
|
