|
Search: id:A123782
|
|
|
| A123782 |
|
Number of ways to build a contiguous building with n LEGO blocks of size 1x4 on top of a fixed block of the same size. |
|
+0
1
|
|
| 23, 679, 27591, 1227556, 59212274, 2990304700, 156407426393
(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: A123779 A123780 A123781 this_sequence A123783 A123784 A123785
Sequence in context: A129991 A023295 A142553 this_sequence A023278 A013362 A013365
|
|
KEYWORD
|
nonn,hard
|
|
AUTHOR
|
Soren Eilers (eilers(AT)math.ku.dk), Oct 29 2006
|
|
|
Search completed in 0.002 seconds
|
