A183522 Number of nX5 0..2 arrays with each element equal to either the sum mod 3 of its horizontal and vertical neighbors or the sum mod 3 of its diagonal and antidiagonal neighbors.
13, 309, 2233, 27609, 371691, 4406933, 56562977, 728459961, 9260503697, 118800214951, 1524147275433, 19534446701521, 250583781238959, 3214379129443263, 41229745589418633, 528882044555348133
Offset: 1
Keywords
Examples
Some solutions for 3X5 ..2..2..1..0..2....0..2..0..0..0....2..1..1..2..1....0..1..0..0..1 ..0..2..0..2..0....1..2..0..1..0....1..0..0..1..2....2..1..0..2..1 ..1..1..1..2..2....0..2..0..0..1....0..0..0..0..2....0..1..0..0..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..21
Comments