|
| |
|
|
A112390
|
|
Triangle read by rows: T(n,k) is the number of ways of building a building of height k using n 2 X 4 Lego blocks, counted up to symmetry (for 2 <= k <= n).
|
|
1
| |
|
|
24, 500, 1060, 11707, 59201, 48672, 248688, 3203175, 4425804, 2238736, 7946227, 162216127, 359949655, 282010252, 102981504
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 2,1
|
|
|
REFERENCES
| B. Durhuus and S. Eilers, On entropy of LEGO, arXiv:math.CO/0504039
Anthony Lane, The Joy of Bricks, New Yorker, Apr 27-May 04, 1998, pp. 96-103.
|
|
|
LINKS
| S. Eilers, A LEGO Counting problem
|
|
|
EXAMPLE
| Triangle begins:
24
500 1060
11707 59201 48672
248688 3203175 4425804 2238736
7946227 162216127 359949655 282010252 102981504
|
|
|
CROSSREFS
| Cf. A112389.
Sequence in context: A109143 A186863 A004383 * A166757 A055007 A014907
Adjacent sequences: A112387 A112388 A112389 * A112391 A112392 A112393
|
|
|
KEYWORD
| nonn,tabl
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Dec 06 2005
|
|
|
EXTENSIONS
| Thanks to Gerald McGarvey, Christian Schroeder and Jud McCranie who contributed to this entry.
|
| |
|
|
