|
Search: id:A123774
|
|
|
| A123774 |
|
Number of ways to build a contiguous building with n LEGO blocks of size 1x3 on top of a fixed block of the same size. |
|
+0
1
|
|
| 14, 244, 5762, 147801, 4117161, 119893930, 3616711327, 111950012510, 3536272532516
(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
|
Adjacent sequences: A123771 A123772 A123773 this_sequence A123775 A123776 A123777
Sequence in context: A120048 A079563 A055477 this_sequence A074815 A051622 A113377
|
|
KEYWORD
|
nonn,hard
|
|
AUTHOR
|
Soren Eilers (eilers(AT)math.ku.dk), Oct 29 2006
|
|
|
Search completed in 0.002 seconds
|
