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.

A263123 Number of (n+3)X(5+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

52446, 887805, 17782827, 344322375, 6946980030, 113558538589, 2022945129963, 36861501672007, 713132356848318, 12055652684915197
Offset: 1

Views

Author

R. H. Hardin, Oct 10 2015

Keywords

Comments

Column 5 of A263124.

Examples

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

Crossrefs

Cf. A263124.