|
Search: id:A049429
|
|
|
| A049429 |
|
Triangle T(n,d) = number of distinct d-dimensional polyominoes (or polycubes) with n cells (n >= 2,d>=1). |
|
+0
9
|
|
| 1, 1, 1, 1, 4, 2, 1, 11, 11, 3, 1, 34, 77, 35, 6, 1, 107, 499, 412, 104, 11, 1, 368, 3442, 4888, 2009, 319, 23, 1, 1284, 24128, 57122, 36585, 8869, 951, 47
(list; table; graph; listen)
|
|
|
OFFSET
|
2,5
|
|
|
REFERENCES
|
Dan Hoey, Bill Gosper and Rich Schroeppel, Discussions in Math-Fun Mailing list, circa Jul 13 1999.
|
|
LINKS
|
R. C. Schroeppel, A few mathematical experiments
|
|
EXAMPLE
|
1; 1,1; 1,4,2; 1,11,11,3; ...
|
|
CROSSREFS
|
Cf. A049430. Row sums give A005519. Rows give A006765-A006768.
Sequence in context: A063983 A021010 A075397 this_sequence A109244 A039948 A111536
Adjacent sequences: A049426 A049427 A049428 this_sequence A049430 A049431 A049432
|
|
KEYWORD
|
nonn,nice,tabl,hard
|
|
AUTHOR
|
Richard Schroeppel (rcs(AT)cheltenham.CS.Arizona.EDU)
|
|
|
Search completed in 0.002 seconds
|
