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.

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

Original entry on oeis.org

2, 5, 90, 2399, 570922, 394241389, 1456404454010, 19392931688071671, 1134083007177482717802, 256890679674803015904974405, 239672757231397671662393429466490
Offset: 1

Views

Author

R. H. Hardin, Sep 18 2015

Keywords

Comments

Diagonal of A262332.

Examples

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

Crossrefs

Cf. A262332.