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.

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

Original entry on oeis.org

1, 3, 36, 457, 30229, 8080915, 15659602612
Offset: 1

Views

Author

R. H. Hardin, Sep 23 2015

Keywords

Comments

Diagonal of A262472.

Examples

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

Crossrefs

Cf. A262472.