|
%I #4 Oct 12 2015 11:46:07
%S 4,72,1009,12601,198892,3345984,56362801,951167305,16140651460,
%T 274301213400,4662032059249,79241699410777,1347050532750556,
%U 22899642182348976,389291621638482865,6617932860469046761
%N Number of (n+1)X(3+1) 0..2 arrays with each row and column divisible by 5, read as a base-3 number with top and left being the most significant digits.
%C Column 3 of A263224.
%H R. H. Hardin, <a href="/A263219/b263219.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 24*a(n-1) -119*a(n-2) +2261*a(n-4) -54264*a(n-5) +269059*a(n-6) -1067290*a(n-8) +25614960*a(n-9) -127007510*a(n-10) +160126570*a(n-12) -3843037680*a(n-13) +19055061830*a(n-14) -8388238565*a(n-16) +201317725560*a(n-17) -998200389235*a(n-18) +103391555281*a(n-20) -2481397326744*a(n-21) +12303595078439*a(n-22) -95162378256*a(n-24) +2283897078144*a(n-25) -11324323012464*a(n-26)
%e Some solutions for n=4
%e ..1..0..1..0....2..2..2..2....1..0..1..0....0..1..2..0....0..2..2..1
%e ..0..0..1..2....0..0..1..2....2..0..0..1....2..1..0..2....2..0..0..1
%e ..2..1..0..2....0..2..2..1....1..0..1..0....0..1..2..0....0..0..0..0
%e ..0..2..0..2....2..0..2..0....2..0..0..1....2..1..0..2....2..2..2..2
%e ..1..0..2..2....2..0..2..0....0..0..0..0....0..0..0..0....0..2..2..1
%Y Cf. A263224.
%K nonn
%O 1,1
%A _R. H. Hardin_, Oct 12 2015
| 