Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A123798
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A123798 Number of ways to build a contiguous building with n LEGO blocks of size 1x6 on top of a fixed block of the same size. +0
1
47, 2944, 256193, 24607451, 2555265136, 278052511951 (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: A123795 A123796 A123797 this_sequence A123799 A123800 A123801

Sequence in context: A009991 A052463 A005148 this_sequence A104069 A101629 A033520

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 May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research