|
%I #9 Jan 01 2019 20:13:45
%S 2,3,8,23,67,200,597,1790,5369,16105,48314,144939,434816,1304447,
%T 3913339,11740016,35220045,105660134,316980401,950941201,2852823602,
%U 8558470803,25675412408,77026237223,231078711667,693236135000,2079708404997
%N Number of (n+1) X (1+1) 0..4 arrays with each row and column divisible by 11, read as a base-5 number with top and left being the most significant digits.
%H R. H. Hardin, <a href="/A263459/b263459.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 3*a(n-1) + a(n-5) - 3*a(n-6).
%F Empirical g.f.: x*(2 - 3*x - x^2 - x^3 - 2*x^4 - 3*x^5) / ((1 - x)*(1 - 3*x)*(1 + x + x^2 + x^3 + x^4)). - _Colin Barker_, Jan 01 2019
%e Some solutions for n=4:
%e ..0..0....2..1....0..0....4..2....0..0....4..2....4..2....0..0....0..0....0..0
%e ..0..0....0..0....0..0....2..1....4..2....2..1....2..1....4..2....2..1....0..0
%e ..4..2....4..2....0..0....0..0....2..1....4..2....0..0....2..1....4..2....0..0
%e ..2..1....2..1....4..2....4..2....4..2....2..1....0..0....0..0....0..0....0..0
%e ..0..0....4..2....2..1....2..1....2..1....0..0....0..0....0..0....2..1....0..0
%Y Column 1 of A263464.
%K nonn
%O 1,1
%A _R. H. Hardin_, Oct 19 2015
| 