A263121 Number of (n+3)X(3+3) 0..1 arrays with each row divisible by 15 and column not divisible by 15, read as a binary number with top and left being the most significant bits.
168, 1664, 10356, 56288, 238104, 1294448, 6844676, 35274768, 166684808, 837700064, 4262833076, 21682367296, 106913755512, 530662478800, 2665248077636, 13441453266928, 67154044231144, 333650046421056
Offset: 1
Keywords
Examples
Some solutions for n=4 ..1..0..1..1..0..1....0..0..1..1..1..1....1..1..1..1..0..0....1..1..1..1..0..0 ..1..0..1..1..0..1....0..0..0..0..0..0....0..0..0..0..0..0....0..0..1..1..1..1 ..1..1..1..1..0..0....0..0..1..1..1..1....0..0..1..1..1..1....1..0..1..1..0..1 ..0..0..1..1..1..1....0..1..1..1..1..0....1..1..1..1..0..0....0..0..1..1..1..1 ..1..0..1..1..0..1....0..0..1..1..1..1....1..1..1..1..0..0....1..1..1..1..0..0 ..0..0..0..0..0..0....1..0..1..1..0..1....0..1..1..1..1..0....0..1..1..1..1..0 ..0..1..1..1..1..0....1..0..1..1..0..1....1..1..1..1..0..0....0..0..1..1..1..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..210
Crossrefs
Cf. A263124.
Comments