|
Search: id:A123790
|
|
|
| A123790 |
|
Number of ways to build a contiguous building with n LEGO blocks of size 1x5 on top of a fixed block of the same size. |
|
+0
1
|
|
| 34, 1516, 93664, 6366476, 468438942, 36108392112, 2882260782674
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
The base block is not counted among the n, and must be the only block in the bottom layer of the building
|
|
REFERENCES
|
M. Abrahamsen and S. Eilers, Efficient counting of LEGO buildings, in preparation
B. Durhuus and S. Eilers, On the entropy of LEGO, arXiv:math.CO/0504039
|
|
LINKS
|
S. Eilers, LEGO counts
|
|
CROSSREFS
|
Sequence in context: A009978 A041545 A093550 this_sequence A086881 A056566 A138590
Adjacent sequences: A123787 A123788 A123789 this_sequence A123791 A123792 A123793
|
|
KEYWORD
|
nonn,hard
|
|
AUTHOR
|
Soren Eilers (eilers(AT)math.ku.dk), Oct 29 2006
|
|
|
Search completed in 0.002 seconds
|
