login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049429 Triangle T(n,d) = number of distinct d-dimensional polyominoes (or polycubes) with n cells (n >= 2,d>=1). 10
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; refs; listen; history; text; internal format)
OFFSET

2,5

REFERENCES

Dan Hoey, Bill Gosper and Richard C. Schroeppel, Discussions in Math-Fun Mailing list, circa Jul 13 1999.

LINKS

Table of n, a(n) for n=2..37.

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: A021010 A193607 A075397 * A183158 A174005 A152818

Adjacent sequences:  A049426 A049427 A049428 * A049430 A049431 A049432

KEYWORD

nonn,nice,tabl,hard,changed

AUTHOR

Richard C. Schroeppel

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified September 23 21:14 EDT 2017. Contains 292391 sequences.