Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #8 Aug 15 2018 12:38:00
%S 16,530,17694,591476,19776286,661254950,22110369320,739304841874,
%T 24720154977078,826568484486164,27637992729347366,924132309919617038,
%U 30900237030548459544,1033212061004215656522,34547539617728922860542
%N Number of n X 3 0..5 arrays with entries increasing mod 6 by 0, 1, 2 or 3 rightwards and downwards, starting with upper left zero.
%C Column 3 of A222104.
%H R. H. Hardin, <a href="/A222099/b222099.txt">Table of n, a(n) for n = 1..143</a>
%F Empirical: a(n) = 42*a(n-1) - 302*a(n-2) + 521*a(n-3) + 114*a(n-4) - 144*a(n-5).
%F Empirical g.f.: 2*x*(8 - 71*x + 133*x^2 + 26*x^3 - 36*x^4) / (1 - 42*x + 302*x^2 - 521*x^3 - 114*x^4 + 144*x^5). - _Colin Barker_, Aug 15 2018
%e Some solutions for n=3:
%e ..0..0..3....0..2..5....0..0..1....0..0..3....0..2..4....0..0..2....0..2..5
%e ..3..0..0....2..4..0....0..3..4....0..2..5....1..3..4....0..2..2....1..3..0
%e ..0..0..1....5..5..1....2..4..1....1..3..5....2..4..0....2..2..3....1..4..0
%Y Cf. A222104.
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 07 2013