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!)
A210270 Half the number of (n+1)X3 0..2 arrays with every 2X2 subblock having two or three distinct clockwise edge differences 1

%I #5 Mar 31 2012 12:37:32

%S 273,5558,113248,2307956,47036870,958632858,19537398722,398181683100,

%T 8115136633050,165390438528106,3370737726383882,68697277333917074,

%U 1400083986498649180,28534393870466854178,581544851172163483038

%N Half the number of (n+1)X3 0..2 arrays with every 2X2 subblock having two or three distinct clockwise edge differences

%C Column 2 of A210276

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

%F Empirical: a(n) = 20*a(n-1) +26*a(n-2) -364*a(n-3) -218*a(n-4) +1203*a(n-5) -418*a(n-6) -394*a(n-7) +216*a(n-8) -20*a(n-9)

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Mar 19 2012

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 March 28 17:42 EDT 2024. Contains 371254 sequences. (Running on oeis4.)