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.

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

Original entry on oeis.org

59, 522, 10356, 316392, 17782827, 881938092, 47672389112, 2695098564336, 159284816028475, 9294738455527194
Offset: 1

Views

Author

R. H. Hardin, Oct 10 2015

Keywords

Comments

Row 3 of A263124.

Examples

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

Crossrefs

Cf. A263124.