login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A123764 Number of ways, counted up to symmetry, to build a contiguous building with n LEGO blocks of size 1 X 2 which is flat, i.e., with all blocks in parallel position. 0
1, 2, 7, 24, 99, 416, 1854, 8407, 38970, 182742, 866442, 4140607, 19925401, 96430625, 469005432, 2290860538, 11232074043, 55255074216, 272634835875 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

S. Eilers, The LEGO counting problem, Amer. Math. Mnthly, 123 (May 2016), 415-426.

LINKS

Table of n, a(n) for n=1..19.

M. Abrahamsen and S. Eilers, On the asymptotic enumeration of LEGO structures, Exper Math. 20 (2) (2011) 145-152.

B. Durhuus and S. Eilers, On the entropy of LEGO, arXiv:math/0504039 [math.CO], 2005.

S. Eilers, A LEGO Counting problem, 2005.

Index entry for sequences related to LEGO blocks

CROSSREFS

Sequence in context: A150436 A197553 A213950 * A150437 A150438 A150439

Adjacent sequences:  A123761 A123762 A123763 * A123765 A123766 A123767

KEYWORD

nonn,hard

AUTHOR

Søren Eilers, Oct 29 2006

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified September 22 00:25 EDT 2017. Contains 292326 sequences.