A262920 Number of (6+1)X(n+1) 0..1 arrays with each row divisible by 3 and each column divisible by 7, read as a binary number with top and left being the most significant bits.

19, 61, 1207, 7417, 152587, 1550557, 30497815, 420921961, 7895204299, 126160746301, 2313326012887, 39531526974937, 720265713036427, 12724622932131997, 232102910290030615, 4177632885527495881

Offset: 1

Author

R. H. Hardin, Oct 04 2015

Keywords

• nonn

Comments

Row 6 of A262917.

Examples

			Some solutions for n=4
..0..0..0..1..1....0..0..1..1..0....0..0..1..1..0....0..0..0..0..0
..0..0..0..1..1....1..1..1..1..0....1..0..0..1..0....0..1..1..1..1
..0..1..0..0..1....1..1..1..1..0....1..1..0..1..1....0..0..1..1..0
..0..0..0..0..0....1..1..0..1..1....1..1..0..1..1....1..0..0..1..0
..0..1..1..0..0....0..1..1..1..1....0..1..1..1..1....1..0..0..1..0
..0..0..1..1..0....0..1..1..1..1....0..0..1..1..0....1..1..0..1..1
..0..1..1..0..0....0..1..1..0..0....0..0..0..0..0....0..1..1..1..1
		

Links

• R. H. Hardin, Table of n, a(n) for n = 1..210
• R. H. Hardin, Empirical recurrence of order 65

Crossrefs

Cf. A262917.

Formula

Empirical recurrence of order 65 (see link above)