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.

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

Original entry on oeis.org

103, 10609, 129481, 4403641, 411861253, 41261408089, 3605017226155, 349760937840517, 35889961902343951, 3691924453378494385, 377481144200284897993, 38754821017971389203489, 3991173847744285567358317
Offset: 1

Views

Author

R. H. Hardin, Sep 17 2015

Keywords

Comments

Column 7 of A262274.

Examples

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

Crossrefs

Cf. A262274.