|
%I #8 Jan 31 2019 19:36:47
%S 8,144,528,2320,9744,41360,175120,741904,3142672,13312656,56393232,
%T 238885648,1011935760,4286628752,18158450704,76920431632,325840177168,
%U 1380281140368,5846964738576,24768140094736,104919525117456
%N Number of n X 5 0..2 arrays with no element equal to any value at offset (-2,-2) (-1,-2) or (0,-1) and new values introduced in order 0..2.
%H R. H. Hardin, <a href="/A275139/b275139.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 3*a(n-1) + 5*a(n-2) + a(n-3) for n>4.
%F Conjectures from _Colin Barker_, Jan 31 2019: (Start)
%F G.f.: 8*x*(1 + 15*x + 7*x^2 + x^3) / ((1 + x)*(1 - 4*x - x^2)).
%F a(n) = 8*(2*(-1)^n - (2*((2-sqrt(5))^n - (2+sqrt(5))^n))/sqrt(5)) for n>1.
%F (End)
%e Some solutions for n=5:
%e ..0..1..2..1..0. .0..1..0..2..1. .0..1..0..1..0. .0..1..2..1..2
%e ..2..1..2..0..1. .1..2..1..0..1. .2..1..2..0..2. .0..1..2..0..1
%e ..2..0..1..2..1. .1..0..2..0..2. .2..0..1..2..1. .2..0..1..0..1
%e ..1..0..1..2..0. .2..1..2..1..0. .1..0..1..2..0. .2..0..1..2..0
%e ..1..2..0..2..0. .2..1..0..2..0. .1..2..0..1..0. .2..1..0..2..0
%Y Column 5 of A275142.
%K nonn
%O 1,1
%A _R. H. Hardin_, Jul 17 2016
| 