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.

A262272 Number of (n+2)X(6+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

52, 2704, 23977, 467065, 20331508, 1002110608, 41261408089, 1965295140265, 100013594816980, 5157201006399760, 263679548424381769, 13615797474906740569, 706318618109394294196, 36687081176072230888336
Offset: 1

Views

Author

R. H. Hardin, Sep 17 2015

Keywords

Comments

Column 6 of A262274.

Examples

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

Crossrefs

Cf. A262274.