Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A123764
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A123764 Number of ways, counted up to symmetry, to build a contiguous building with n LEGO blocks of size 1x2 which is flat, i.e. with all blocks in parallel position. +0
1
1, 2, 7, 24, 99, 416, 1854, 8407, 38970, 182742, 866442, 4140607, 19925401, 96430625, 469005432, 2290860538, 11232074043, 55255074216, 272634835875 (list; graph; listen)
OFFSET

1,2

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: A005754 A007162 A102286 this_sequence A013204 A013209 A048506

Adjacent sequences: A123761 A123762 A123763 this_sequence A123765 A123766 A123767

KEYWORD

nonn,hard

AUTHOR

Soren Eilers (eilers(AT)math.ku.dk), Oct 29 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research