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

A260101

Number of (n+2)X(3+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000101 or 00010101

206, 477, 1136, 2768, 6878, 17125, 42372, 104772, 258690, 639184, 1578958, 3902316, 9640990, 23821537, 58852874, 145410924, 359251828, 887606592, 2192956508, 5418102592, 13386231028, 33072997411, 81712020092, 201883197204

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

OFFSET

1,1

COMMENTS

Column 3 of A260106

LINKS

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

FORMULA

Empirical: a(n) = 3*a(n-2) +3*a(n-3) +13*a(n-4) +9*a(n-5) -a(n-6) -15*a(n-7) -85*a(n-8) -97*a(n-9) -130*a(n-10) -106*a(n-11) +6*a(n-12) +115*a(n-13) +537*a(n-14) +649*a(n-15) +592*a(n-16) +680*a(n-17) -2*a(n-18) -661*a(n-19) -954*a(n-20) -1415*a(n-21) -1370*a(n-22) -746*a(n-23) +52*a(n-24) +491*a(n-25) +557*a(n-26) +394*a(n-27) -41*a(n-28) -119*a(n-29) +32*a(n-30) +38*a(n-31) -2*a(n-32) +6*a(n-34) for n>35

EXAMPLE

Some solutions for n=4

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

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

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

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

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

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

CROSSREFS

Cf. A260106

Sequence in context: A222619 A252270 A113934 * A113490 A054007 A285754

Adjacent sequences: A260098 A260099 A260100 * A260102 A260103 A260104

KEYWORD

nonn

AUTHOR

R. H. Hardin, Jul 16 2015

STATUS

approved