A269219 Number of 6Xn 0..3 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling three exactly once.
0, 889056, 118872576, 17118725376, 2267772823680, 292321215814512, 36713945487331392, 4528086446983948224, 550465224463202188320, 66156064863501806179776, 7876627077577027391888640
Offset: 1
Keywords
Examples
Some solutions for n=2 ..0..2. .0..0. .0..0. .0..0. .0..1. .0..0. .0..0. .0..1. .0..0. .0..2 ..0..1. .2..3. .0..1. .0..2. .0..0. .0..2. .0..2. .0..1. .0..0. .0..0 ..3..1. .3..2. .1..1. .3..2. .3..1. .2..0. .2..2. .3..2. .2..3. .0..2 ..3..3. .2..2. .1..3. .3..3. .0..2. .2..2. .3..2. .0..3. .2..0. .3..0 ..2..3. .2..0. .2..1. .1..2. .0..1. .1..0. .3..1. .3..1. .0..0. .2..3 ..3..0. .1..3. .3..2. .2..3. .3..2. .1..1. .0..0. .3..3. .0..2. .3..2
Links
- R. H. Hardin, Table of n, a(n) for n = 1..210
Crossrefs
Cf. A269214.
Comments