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.

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

Original entry on oeis.org

109, 1264, 31512, 3896365, 290338650, 26232879096, 2864161217701, 297481646988280
Offset: 1

Views

Author

R. H. Hardin, Oct 03 2015

Keywords

Comments

Row 5 of A262849.

Examples

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

Crossrefs

Cf. A262849.