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.

A262756 Number of (n+2)X(5+2) 0..1 arrays with each row divisible by 5 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

26, 107, 709, 16450, 135595, 1635877, 37426418, 595006235, 10954392773, 252014772610, 5417495716875, 121326759600741
Offset: 1

Views

Author

R. H. Hardin, Sep 30 2015

Keywords

Comments

Column 5 of A262759.

Examples

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

Crossrefs

Cf. A262759.