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.

A262413 Number of (n+1)X(n+1) 0..1 arrays with each row divisible by 3 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, 4, 270, 18228, 9401742, 15231780324, 114043973318270, 3210825131209677780, 376663000295700912108942, 173793136176160952800090974444, 324528460592527213101965898811701630
Offset: 1

Views

Author

R. H. Hardin, Sep 22 2015

Keywords

Comments

Diagonal of A262420.

Examples

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

Crossrefs

Cf. A262420.