|
| |
|
|
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
| | |
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| 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: A138861 A015257 A199234 * A130004 A182784 A139162
Adjacent sequences: A123823 A123824 A123825 * A123827 A123828 A123829
|
|
|
KEYWORD
| nonn,hard
|
|
|
AUTHOR
| Soren Eilers (eilers(AT)math.ku.dk), Oct 29 2006
|
| |
|
|
