login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A317629 The number of contiguous buildings which can be built from n 1 X 2 LEGO jumper plates. 0

%I #7 Aug 04 2018 22:56:32

%S 1,6,37,234,1489,9534,61169,393314,2531777,16316262,105237737,

%T 679336650,4388301841,28366361206

%N The number of contiguous buildings which can be built from n 1 X 2 LEGO jumper plates.

%C A 1 X 2 LEGO jumper plate has a single stud on the top face which may be inserted into the bottom face of another such plate in three different positions.

%H David M. McClendon and Jonathon Wilson: <a href="http://mcclendonmath.com/papers/jumperplate.pdf">The entropy of LEGO jumper plates</a>, to appear in The mathematics of various entertaining subjects. Vol. 3, Princeton University Press.

%e The six different ways of connecting one such plate to another yield 6^(n-1) buildings which are of maximal height. The smallest building not of this type occurs at n=3 and has two parallel plates at the bottom level connected by one in the top level which is perpendicular to them.

%K nonn,hard

%O 1,2

%A _Søren Eilers_, Aug 02 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 1 18:25 EDT 2024. Contains 374818 sequences. (Running on oeis4.)