The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A240365 Number of 2Xn 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of the elements above it or two plus the sum of the elements diagonally to its northwest, modulo 4 1

%I

%S 4,15,51,188,672,2452,8822,32077,115811,420299,1519980,5510943,

%T 19945570,72279704,261698918,948113920,3433420924,12437397618,

%U 45043913721,163158785746,590931290044,2140411544446,7752356423111,28079348085009

%N Number of 2Xn 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of the elements above it or two plus the sum of the elements diagonally to its northwest, modulo 4

%C Row 2 of A240364

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

%F Empirical: a(n) = 3*a(n-1) +9*a(n-2) -23*a(n-3) -15*a(n-4) +30*a(n-5) +20*a(n-6) +7*a(n-7) -30*a(n-8) +a(n-9) +23*a(n-10) -8*a(n-11) -8*a(n-12)

%e Some solutions for n=4

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Apr 04 2014

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.

Last modified June 20 09:57 EDT 2021. Contains 345162 sequences. (Running on oeis4.)