|
|
A263334
|
|
Number of (n+2) X (1+2) 0..2 arrays with each row and column divisible by 13, read as a base-3 number with top and left being the most significant digits.
|
|
1
|
|
|
3, 7, 19, 57, 169, 505, 1515, 4543, 13627, 40881, 122641, 367921, 1103763, 3311287, 9933859, 29801577, 89404729, 268214185, 804642555, 2413927663, 7241782987, 21725348961, 65176046881, 195528140641, 586584421923, 1759753265767
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 3*a(n-1) + a(n-3) - 3*a(n-4).
Empirical g.f.: x*(3 - 2*x - 2*x^2 - 3*x^3) / ((1 - x)*(1 - 3*x)*(1 + x + x^2)). - Colin Barker, Jan 01 2019
|
|
EXAMPLE
|
Some solutions for n=4:
..0..0..0....2..2..2....2..2..2....1..1..1....0..0..0....1..1..1....1..1..1
..1..1..1....0..0..0....2..2..2....2..2..2....2..2..2....2..2..2....1..1..1
..0..0..0....2..2..2....1..1..1....2..2..2....0..0..0....2..2..2....1..1..1
..2..2..2....0..0..0....1..1..1....1..1..1....0..0..0....2..2..2....2..2..2
..1..1..1....2..2..2....1..1..1....0..0..0....2..2..2....1..1..1....2..2..2
..2..2..2....0..0..0....2..2..2....0..0..0....1..1..1....1..1..1....2..2..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|