|
%I #17 Oct 08 2017 05:15:54
%S 1,4,7,28,67,289,723,3185,8677,38580,109143,489496,1430283
%N Number of ways to build a contiguous building with n LEGO blocks of size 1 X 2 on top of a fixed block of the same size so that the building is symmetric after a rotation by 180 degrees.
%C The base block is not counted among the n and must be the only block in the bottom layer of the building.
%H M. Abrahamsen and S. Eilers, <a href="http://dx.doi.org/10.1080/10586458.2011.564539">On the asymptotic enumeration of LEGO structures</a>, Exper Math. 20 (2) (2011) 145-152.
%H B. Durhuus and S. Eilers, <a href="http://arxiv.org/abs/math/0504039">On the entropy of LEGO</a>, arXiv:math/0504039 [math.CO], 2005.
%H S. Eilers, <a href="http://www.jstor.org/stable/10.4169/amer.math.monthly.123.5.415">The LEGO counting problem</a>, Amer. Math. Monthly, 123 (May 2016), 415-426.
%H <a href="/wiki/Index_to_OEIS:_Section_Lc#LEGO">Index entry for sequences related to LEGO blocks</a>
%K nonn
%O 1,2
%A _Søren Eilers_, Oct 29 2006
|
