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.

A263371 Number of (n+1)X(6+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

19, 367, 107514, 27274339, 8491666657, 2535097569590, 787253224440475, 245171742019939573, 76738178529099193548, 24012353212352081646593, 7515855702189389861141905, 2352317017039363043975969464
Offset: 1

Views

Author

R. H. Hardin, Oct 16 2015

Keywords

Comments

Column 6 of A263373.

Examples

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

Crossrefs

Cf. A263373.