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

%I #8 Feb 12 2018 15:12:45

%S 0,0,8,37,169,811,3878,18502,88302,421463,2011587,9601013,45824300,

%T 218713020,1043886804,4982326441,23779950797,113498396063,

%U 541712050514,2585516235106,12340309202426,58898578606299,281114719650631

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

%C Row 2 of A221890.

%H R. H. Hardin, <a href="/A221891/b221891.txt">Table of n, a(n) for n = 1..162</a>

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

%F Empirical g.f.: x^3*(8 - 3*x) / (1 - 5*x + 2*x^2 - 5*x^3 + 3*x^4). - _Colin Barker_, Feb 12 2018

%e Some solutions for n=4:

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

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

%K nonn

%O 1,3

%A _R. H. Hardin_, Jan 30 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 25 06:49 EDT 2024. Contains 371964 sequences. (Running on oeis4.)