# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/
Search: id:a123765
Showing 1-1 of 1
%I A123765 #21 Sep 12 2018 06:15:16
%S A123765 1,1,3,4,12,18,52,83,235,389,1087,1851,5113,8891,24357,43045,117127,
%T A123765 209731,567487,1027245,2766404,5053521,13554315,24954627,66696366,
%U A123765 123628610,329400200,614216837,1632039074,3059240151,8108703876
%N A123765 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 and symmetric after a rotation by 180 degrees.
%H A123765 M. Abrahamsen and S. Eilers, On the asymptotic enumeration of LEGO structures, Exper Math. 20 (2) (2011) 145-152.
%H A123765 B. Durhuus and S. Eilers, On the entropy of LEGO, arXiv:math.CO/0504039
%H A123765 S. Eilers, The LEGO counting problem, Amer. Math. Monthly, 123 (May 2016), 415-426.
%H A123765 Index entry for sequences related to LEGO blocks
%K A123765 nonn,more
%O A123765 1,3
%A A123765 _Søren Eilers_, Oct 29 2006
%E A123765 More terms by _Søren Eilers_, Sep 12 2018
# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE