Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A123772
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A123772 Number of ways, counted up to symmetry, to build a contiguous building with n LEGO blocks of size 1x3 which is flat, i.e. with all blocks in parallel position. +0
1
1, 3, 17, 107, 761, 5607, 42730, 331851, 2618024, 20895964, 168398683, 1367838390, 11184711448, 91976811135 (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: A162479 A074563 A077145 this_sequence A103730 A074556 A119259

Adjacent sequences: A123769 A123770 A123771 this_sequence A123773 A123774 A123775

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research