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

A199126

Number of nX1 0..2 arrays with values 0..2 introduced in row major order, the number of instances of each value within one of each other, and no element equal to any horizontal or vertical neighbor

1, 1, 1, 3, 6, 5, 19, 37, 29, 124, 240, 182, 834, 1614, 1198, 5746, 11137, 8142, 40336, 78332, 56620, 287358, 559134, 400598, 2071558, 4038130, 2872754, 15079270, 29443040, 20824778, 110653854, 216379650, 152303410, 817542980, 1600817660

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

OFFSET

1,4

COMMENTS

Column 1 of A199133

LINKS

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

FORMULA

Conjecture: a(3n) = A190917(n). - R. J. Mathar, Nov 01 2015

EXAMPLE

All solutions for n=5

..0....0....0....0....0....0