|
Search: id:A123826
|
|
|
| A123826 |
|
Number of ways to build a contiguous building with n LEGO blocks of size 2x3 on top of a fixed block of the same size. |
|
+0
1
|
|
| 31, 1165, 57415, 3060464, 176633912, 10625603236, 661642082820
(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: A123823 A123824 A123825 this_sequence A123827 A123828 A123829
Sequence in context: A138958 A138861 A015257 this_sequence A130004 A139162 A078961
|
|
KEYWORD
|
nonn,hard
|
|
AUTHOR
|
Soren Eilers (eilers(AT)math.ku.dk), Oct 29 2006
|
|
|
Search completed in 0.002 seconds
|
