|
| |
|
|
A123821
|
|
Number of ways to build a contiguous building with n LEGO blocks of size 2 X 2 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: A180675 A083077 A194725 * A145509 A098782 A076758
Adjacent sequences: A123818 A123819 A123820 * A123822 A123823 A123824
|
|
|
KEYWORD
| nonn,hard
|
|
|
AUTHOR
| Soren Eilers (eilers(AT)math.ku.dk), Oct 29 2006
|
| |
|
|
