login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A218236 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..3 n X 2 array. 2
3, 15, 63, 255, 1017, 4065, 16257, 65025, 260091, 1040319, 4161087, 16643583, 66571281, 266272929, 1065042945, 4259976705, 17039126547, 68153385231, 272601057663, 1090354299903, 4361217485769, 17444071124289, 69773089368321 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Column 2 of A218242.

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..210

FORMULA

Empirical: a(n) = 3*a(n-1) + 3*a(n-2) + 3*a(n-3) + 3*a(n-4) + 3*a(n-5) + 3*a(n-6) + 3*a(n-7).

Empirical g.f.: 3*x*(1 + x)^2*(1 + x^2)^2 / (1 - 3*x - 3*x^2 - 3*x^3 - 3*x^4 - 3*x^5 - 3*x^6 - 3*x^7). - Colin Barker, Mar 10 2018

EXAMPLE

Some solutions for n=3:

..1..0....1..1....0..1....0..1....1..1....1..0....0..0....0..1....1..0....1..1

..0..1....0..1....1..0....1..1....1..1....1..0....0..0....1..1....1..0....0..0

..1..0....1..0....0..1....0..0....0..0....1..0....1..0....1..1....0..0....0..1

CROSSREFS

Cf. A218242.

Sequence in context: A218190 A216757 A218366 * A218282 A103454 A024036

Adjacent sequences:  A218233 A218234 A218235 * A218237 A218238 A218239

KEYWORD

nonn

AUTHOR

R. H. Hardin, Oct 24 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 25 22:37 EST 2021. Contains 341618 sequences. (Running on oeis4.)