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.

A260833 Number of (n+2)X(n+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010101.

Original entry on oeis.org

48, 131, 700, 2235, 3828, 19718, 80516, 181176, 766388, 3885356, 12122540, 43330160, 229463444, 972300920, 3559612500, 17890822312, 91527500980
Offset: 1

Views

Author

R. H. Hardin, Aug 01 2015

Keywords

Comments

Diagonal of A260841

Examples

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

Crossrefs