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!)
A233686 Number of (n+1)X(3+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

%S 356,2628,19248,145512,1095164,8284072,62569964,473123164,3575792884,

%T 27033634800,204346864164,1544799897832,11677617006096,88277308600968,

%U 667323988066868,5044620581563464,38134490738693688,288276154246399008

%N Number of (n+1)X(3+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 3 of A233691

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

%F Empirical: a(n) = 7*a(n-1) +30*a(n-2) -198*a(n-3) -190*a(n-4) +1708*a(n-5) +65*a(n-6) -6015*a(n-7) +1916*a(n-8) +9134*a(n-9) -3808*a(n-10) -5930*a(n-11) +2155*a(n-12) +1461*a(n-13) -312*a(n-14) -112*a(n-15)

%e Some solutions for n=4

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

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

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

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

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

%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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 17 04:08 EST 2022. Contains 350377 sequences. (Running on oeis4.)