A259510 - 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

A259510

Number of (n+1)X(3+1) 0..1 arrays with each 2X2 subblock having clockwise pattern 0000 0001 0101 0111

87, 533, 3270, 20293, 126045, 784130, 4879059, 30366347, 189000090, 1176388523, 7322185101, 45575811794, 283679519673, 1765722127481, 10990478900276, 68408656100315, 425799800891931, 2650329642920874, 16496595246904901

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

OFFSET

1,1

COMMENTS

Column 3 of A259515

LINKS

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

FORMULA

Empirical: a(n) = 5*a(n-1) +20*a(n-2) -68*a(n-3) -97*a(n-4) +234*a(n-5) +159*a(n-6) -238*a(n-7) -94*a(n-8) +56*a(n-9) +8*a(n-10)

EXAMPLE

Some solutions for n=4

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