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!)
A221829 Number of 2 X n arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, without 2-loops or left turns. 1

%I #12 Aug 11 2018 10:45:49

%S 0,3,16,73,333,1519,6929,31607,144177,657671,3000001,13684663,

%T 62423313,284747239,1298889569,5924953367,27026987697,123285031751,

%U 562371183361,2565285853303,11701686899793,53377862792359,243485940162209

%N Number of 2 X n arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, without 2-loops or left turns.

%C Row 2 of A221828.

%H R. H. Hardin, <a href="/A221829/b221829.txt">Table of n, a(n) for n = 1..210</a>

%F Empirical: a(n) = 5*a(n-1) - 2*a(n-2) for n>4.

%F Conjectures from _Colin Barker_, Aug 11 2018: (Start)

%F G.f.: x^2*(3 + x - x^2) / (1 - 5*x + 2*x^2).

%F a(n) = (2^(-4-n)*((5-sqrt(17))^n*(-7+sqrt(17)) + (5+sqrt(17))^n*(7+sqrt(17)))) / sqrt(17) for n>2.

%F (End)

%e Some solutions for n=3:

%e ..1..1..0....0..2..0....0..2..1....0..2..1....1..1..1....0..2..2....1..1..0

%e ..2..1..1....1..2..1....1..2..0....1..1..1....1..2..0....0..1..1....1..2..1

%Y Cf. A221828.

%K nonn

%O 1,2

%A _R. H. Hardin_, Jan 26 2013

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 April 24 15:18 EDT 2024. Contains 371960 sequences. (Running on oeis4.)