A302164 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

Other ways to Give

A302164

Number of 2Xn 0..1 arrays with every element equal to 0, 1 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

2, 3, 9, 17, 25, 65, 185, 385, 649, 1489, 3929, 8609, 15913, 34545, 85497, 191809, 377545, 802961, 1894553, 4279521, 8785769, 18612785, 42501945, 95817857, 202153993, 429672401, 960801241, 2153871393, 4621792425, 9879318897

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

Row 2 of A302163.

LINKS

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

FORMULA

Empirical: a(n) = a(n-1) +16*a(n-4) -8*a(n-5) for n>6

EXAMPLE

Some solutions for n=5

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