|
|
A266049
|
|
Number of n X 2 integer arrays with each element equal to the number of horizontal and antidiagonal neighbors less than or equal to itself.
|
|
1
|
|
|
3, 7, 35, 176, 819, 3927, 18711, 89179, 425184, 2026855, 9662395, 46062279, 219586403, 1046805072, 4990293595, 23789558831, 113408780759, 540638504187, 2577313596096, 12286482224079, 58571702593459, 279221040017415
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 3*a(n-1) + 7*a(n-2) + 7*a(n-3) - a(n-4).
Empirical g.f.: x*(3 - 2*x - 7*x^2 + x^3) / (1 - 3*x - 7*x^2 - 7*x^3 + x^4). - Colin Barker, Jan 09 2019
|
|
EXAMPLE
|
Some solutions for n=4:
..0..2....1..0....0..2....1..1....1..1....1..1....0..1....1..1....1..0....1..0
..2..2....1..2....2..0....2..0....2..2....2..0....2..1....2..1....1..2....1..2
..2..2....0..2....2..2....2..0....0..2....2..2....1..2....0..2....1..0....2..2
..1..0....1..1....1..1....2..0....1..1....0..1....1..0....1..1....2..0....1..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|