login

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”).

A218313
Hilltop maps: number of n X 2 binary arrays indicating the locations of corresponding elements not exceeded by any king-move neighbor in a random 0..2 n X 2 array.
2
3, 15, 63, 249, 993, 3969, 15867, 63423, 253503, 1013265, 4050081, 16188417, 64706067, 258633999, 1033775487, 4132062153, 16516098369, 66015828225, 263869194699, 1054700876799, 4215702180735, 16850412536481, 67352101850817
OFFSET
1,1
COMMENTS
Column 2 of A218319.
LINKS
FORMULA
Empirical: a(n) = 3*a(n-1) + 3*a(n-2) + 3*a(n-3) + 3*a(n-4) + 3*a(n-5).
Empirical g.f.: 3*x*(1 + x + x^2)^2 / (1 - 3*x - 3*x^2 - 3*x^3 - 3*x^4 - 3*x^5). - Colin Barker, Mar 10 2018
EXAMPLE
Some solutions for n=3:
..0..1....0..1....1..0....1..1....0..1....1..1....1..0....0..1....0..0....1..0
..0..0....0..0....0..1....0..0....0..1....1..0....1..0....1..1....1..1....0..1
..0..0....1..1....1..1....1..1....1..1....0..0....0..0....1..0....1..1....0..1
CROSSREFS
Cf. A218319.
Sequence in context: A204086 A171761 A229277 * A218190 A216757 A218366
KEYWORD
nonn
AUTHOR
R. H. Hardin, Oct 25 2012
STATUS
approved