cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A218659 Hilltop maps: number of n X 4 binary arrays indicating the locations of corresponding elements not exceeded by any king-move neighbor in a random 0..1 n X 4 array.

Original entry on oeis.org

9, 225, 3249, 50625, 793881, 12383361, 193349025, 3018953025, 47135449449, 735942652641, 11490533873361, 179405691966081, 2801123686963449, 43734921492423681, 682848585990347841, 10661553197658712449
Offset: 1

Views

Author

R. H. Hardin, Nov 04 2012

Keywords

Comments

Column 4 of A218663.

Examples

			Some solutions for n=3:
..0..1..0..1....1..0..1..0....0..0..0..0....1..0..0..0....1..1..1..1
..0..1..0..1....1..1..0..0....0..1..0..1....1..0..1..0....1..0..0..1
..0..0..0..1....0..0..0..1....0..1..1..1....0..1..1..1....0..1..1..0
		

Crossrefs

Cf. A218663.

Formula

Empirical: a(n) = 12*a(n-1) +45*a(n-2) +180*a(n-3) -27*a(n-4) -81*a(n-6).
Empirical g.f.: 9*x*(1 - x)*(1 + 14*x + 30*x^2 + 18*x^3 + 9*x^4) / ((1 + 3*x + 9*x^2 - 9*x^3)*(1 - 15*x - 9*x^2 - 9*x^3)). - Colin Barker, Mar 10 2018