|
%I #5 Feb 10 2013 16:03:28
%S 81,4913,317259,20780181,1366395515,89948464453,5923189816253,
%T 390086038882651,25690815631493191,1691995329032459285,
%U 111434983000652039093,7339124863989795685471,483355986017042494039859
%N Number of nX5 0..4 arrays with entries increasing mod 5 by 0, 1 or 2 rightwards and downwards, starting with upper left zero
%C Column 5 of A222169
%H R. H. Hardin, <a href="/A222166/b222166.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 115*a(n-1) -4157*a(n-2) +69117*a(n-3) -595705*a(n-4) +2449306*a(n-5) -240335*a(n-6) -43350087*a(n-7) +178528425*a(n-8) -183199822*a(n-9) -751284432*a(n-10) +2871335435*a(n-11) -3549608757*a(n-12) -650892687*a(n-13) +7285361378*a(n-14) -9372087568*a(n-15) +5616780205*a(n-16) -1330498112*a(n-17) -261001088*a(n-18) +232979629*a(n-19) -45081325*a(n-20) -1230938*a(n-21) +1537784*a(n-22) -190656*a(n-23) +8208*a(n-24) -108*a(n-25)
%e Some solutions for n=3
%e ..0..0..1..1..3....0..0..1..2..4....0..0..1..2..3....0..0..1..2..2
%e ..1..1..1..3..4....1..1..3..4..1....1..1..2..3..3....0..1..1..2..4
%e ..1..2..2..3..0....1..3..0..1..3....3..3..4..0..0....2..2..2..2..4
%K nonn
%O 1,1
%A _R. H. Hardin_ Feb 10 2013
| 