login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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). 11

%I

%S 1,1,1,1,4,2,1,11,11,3,1,34,77,35,6,1,107,499,412,104,11,1,368,3442,

%T 4888,2009,319,23,1,1284,24128,57122,36585,8869,951,47

%N Triangle T(n,d) = number of distinct d-dimensional polyominoes (or polycubes) with n cells (n >= 2,d>=1).

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

%H R. C. Schroeppel, <a href="http://www.experimentalmath.info/workshop2004/schroeppel-talk.pdf">A few mathematical experiments</a>

%e 1; 1,1; 1,4,2; 1,11,11,3; ...

%Y Cf. A049430. Row sums give A005519. Rows give A006765-A006768.

%K nonn,nice,tabl,hard

%O 2,5

%A Richard C. Schroeppel

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 21 11:25 EDT 2021. Contains 343150 sequences. (Running on oeis4.)