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.

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

13, 37, 129, 1645, 8605, 52993, 658381, 5747701, 51979793, 636258829, 7230695309, 80140442481, 979582061773, 12020681709477, 143857668728353, 1766744698318765, 21995191160679549, 270443634865041121
Offset: 1

Views

Author

R. H. Hardin, Sep 30 2015

Keywords

Comments

Column 4 of A262759.

Examples

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

Crossrefs

Cf. A262759.