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

A204746

Number of (n+2)X(n+2) 0..1 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly three ways, and new values 0..1 introduced in row major order

40, 46, 22, 32, 48, 74, 116, 184, 294, 472, 760, 1226, 1980, 3200, 5174, 8368, 13536, 21898, 35428, 57320, 92742, 150056, 242792, 392842

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

OFFSET

1,1

COMMENTS

Diagonal of A204754

LINKS

Table of n, a(n) for n=1..24.

W. Kuszmaul, Fast Algorithms for Finding Pattern Avoiders and Counting Pattern Occurrences in Permutations, arXiv preprint arXiv:1509.08216, 2015

EXAMPLE

Some solutions for n=6

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