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.

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

Original entry on oeis.org

2, 33, 1666, 498597, 439260642, 1825928130193, 26380510465997186, 1607516667474074649381, 373842629115554331580791202, 353418497958270475251697468005873
Offset: 1

Views

Author

R. H. Hardin, Oct 08 2015

Keywords

Comments

Diagonal of A263060.

Examples

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

Crossrefs

Cf. A263060.