|
%I #4 Dec 25 2014 07:31:42
%S 3465,651,985,1551,2822,5100,8767,16909,32096,57282,113321,218547,
%T 401170,797512,1556859,2906865,5807156,11393142,21638149,43233631,
%U 85341470,163967772,328165247,649686165,1261654624,2524384498,5014289697
%N Number of (n+2)X(6+2) 0..4 arrays with every consecutive three elements in every row and diagonal having exactly two distinct values, and in every column and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order
%C Column 6 of A252961
%H R. H. Hardin, <a href="/A252959/b252959.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 5*a(n-1) -6*a(n-2) -2*a(n-3) -5*a(n-4) +15*a(n-5) +53*a(n-6) -145*a(n-7) +120*a(n-8) -44*a(n-9) +25*a(n-10) -21*a(n-11) +6*a(n-12) for n>15
%e Some solutions for n=2
%e ..0..1..0..0..2..0..0..3....0..1..1..2..1..1..2..1....0..1..1..2..2..3..3..0
%e ..4..4..0..4..4..0..4..4....1..0..1..1..2..1..1..2....3..0..0..1..1..2..2..4
%e ..1..0..0..1..0..0..2..0....3..3..1..3..3..1..3..3....2..3..3..0..0..1..1..2
%e ..0..1..0..0..1..0..0..2....2..1..1..0..1..1..2..1....4..2..2..3..3..0..0..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 25 2014
| 