|
|
A263459
|
|
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.
|
|
1
|
|
|
2, 3, 8, 23, 67, 200, 597, 1790, 5369, 16105, 48314, 144939, 434816, 1304447, 3913339, 11740016, 35220045, 105660134, 316980401, 950941201, 2852823602, 8558470803, 25675412408, 77026237223, 231078711667, 693236135000, 2079708404997
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 3*a(n-1) + a(n-5) - 3*a(n-6).
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
|
|
EXAMPLE
|
Some solutions for n=4:
..0..0....2..1....0..0....4..2....0..0....4..2....4..2....0..0....0..0....0..0
..0..0....0..0....0..0....2..1....4..2....2..1....2..1....4..2....2..1....0..0
..4..2....4..2....0..0....0..0....2..1....4..2....0..0....2..1....4..2....0..0
..2..1....2..1....4..2....4..2....4..2....2..1....0..0....0..0....0..0....0..0
..0..0....4..2....2..1....2..1....2..1....0..0....0..0....0..0....2..1....0..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|