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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A233685 Number of (n+1)X(2+1) 0..3 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 10, and no two adjacent values equal 1

%I #4 Dec 14 2013 19:03:19

%S 108,548,2628,13324,64756,327588,1596200,8064200,39342364,198550888,

%T 969646256,4888808640,23897490056,120377986076,588951127540,

%U 2964164674456,14514267629692,72990785983124,357684877930284

%N Number of (n+1)X(2+1) 0..3 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 10, and no two adjacent values equal

%C Column 2 of A233691

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

%F Empirical: a(n) = a(n-1) +28*a(n-2) -25*a(n-3) -103*a(n-4) +97*a(n-5) +68*a(n-6) -47*a(n-7) -12*a(n-8) +2*a(n-9)

%e Some solutions for n=5

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

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 14 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.

Last modified October 3 18:47 EDT 2023. Contains 365870 sequences. (Running on oeis4.)