A269206 Number of 6Xn 0..3 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling three no more than once.
4096, 1090740, 142233732, 19558138380, 2532677348772, 320994710282892, 39825831571425924, 4865841496644992100, 587133256785089633172, 70137053123425124078748, 8308848756491598850682388
Offset: 1
Keywords
Examples
Some solutions for n=2 ..0..1. .0..0. .0..1. .0..0. .0..0. .0..1. .0..1. .0..0. .0..1. .0..0 ..0..1. .0..0. .0..2. .2..0. .0..2. .0..0. .0..1. .0..1. .0..0. .0..0 ..1..0. .0..1. .3..1. .0..0. .3..2. .2..0. .3..1. .3..1. .2..0. .2..0 ..2..0. .0..2. .1..2. .1..0. .2..0. .0..0. .3..2. .3..3. .3..2. .2..3 ..1..3. .0..2. .2..3. .2..1. .2..3. .2..1. .2..0. .3..3. .2..2. .3..2 ..0..0. .2..3. .2..3. .3..2. .3..2. .1..0. .0..0. .2..3. .0..2. .0..3
Links
- R. H. Hardin, Table of n, a(n) for n = 1..210
Crossrefs
Cf. A269201.
Comments