|
Search: id:A123830
|
|
|
| A123830 |
|
Number of ways to build a contiguous building with n LEGO blocks of size 2x4 on top of a fixed block of the same size. |
|
+0
1
|
|
| 46, 2596, 194834, 15834801, 1395436949, 128352319891, 12224079725173
(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
|
Sequence in context: A115608 A009990 A042013 this_sequence A025763 A134793 A116328
Adjacent sequences: A123827 A123828 A123829 this_sequence A123831 A123832 A123833
|
|
KEYWORD
|
nonn,hard
|
|
AUTHOR
|
Soren Eilers (eilers(AT)math.ku.dk), Oct 29 2006
|
|
|
Search completed in 0.002 seconds
|
