cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A262915 Number of (n+1)X(6+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.

Original entry on oeis.org

1, 43, 261, 2953, 121507, 1550557, 33948145, 1361585275, 42115306149, 1516528236361, 61572663026659, 2451674386383133, 100125715548126961
Offset: 1

Views

Author

R. H. Hardin, Oct 04 2015

Keywords

Comments

Column 6 of A262917.

Examples

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

Crossrefs

Cf. A262917.