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!)
A233677 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 6 1

%I #4 Dec 14 2013 16:17:25

%S 648,4448,28544,216592,1500800,11482368,81243904,617735680,4416166400,

%T 33345630720,240057191680,1802241148160,13042092095744,97474927920896,

%U 708192185963776,5274586398563072,38438858246173952,285526308610159360

%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 6

%C Column 3 of A233682

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

%F Empirical: a(n) = 5*a(n-1) +70*a(n-2) -332*a(n-3) -1384*a(n-4) +6780*a(n-5) +11520*a(n-6) -61568*a(n-7) -45216*a(n-8) +280096*a(n-9) +84864*a(n-10) -653696*a(n-11) -81664*a(n-12) +762880*a(n-13) +41984*a(n-14) -397312*a(n-15) -8192*a(n-16) +65536*a(n-17)

%e Some solutions for n=3

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

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

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

%e ..3..1..3..1....2..3..2..0....1..1..1..3....1..2..2..0....0..0..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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 26 16:21 EST 2024. Contains 370352 sequences. (Running on oeis4.)