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.

A263370 Number of (n+1)X(5+1) 0..2 arrays with each row and column divisible by 7, read as a base-3 number with top and left being the most significant digits.

Original entry on oeis.org

10, 112, 9888, 826249, 84790557, 8491666657, 883978450474, 92359613590072, 9695725030142616, 1017738982928794777, 106860144447454638429, 11219638590333541521601, 1178048734539490226212450
Offset: 1

Views

Author

R. H. Hardin, Oct 16 2015

Keywords

Comments

Column 5 of A263373.

Examples

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

Crossrefs

Cf. A263373.