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.

A263126 Number of (2+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

29, 148, 1664, 28048, 887805, 21881010, 583371100, 16245282600, 474350516221, 13614396562020, 392816467987240, 11368863651747952, 329881756982246141, 9560756720430691666
Offset: 1

Views

Author

R. H. Hardin, Oct 10 2015

Keywords

Comments

Row 2 of A263124.

Examples

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

Crossrefs

Cf. A263124.