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.

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

Original entry on oeis.org

366629, 12652497, 398648507, 11542428929, 333834894509, 9669206035811, 281744631338581, 8168432979144243, 236803228434060000, 6872338129370139753, 199369625571670867675, 5782741479669647970363, 167698271515683910798963
Offset: 1

Views

Author

R. H. Hardin, Oct 11 2015

Keywords

Comments

Column 2 of A263198.

Examples

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

Crossrefs

Cf. A263198.