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.

A222335 Number of nX2 0..6 arrays with no entry increasing mod 7 by 6 rightwards or downwards, starting with upper left zero.

Original entry on oeis.org

6, 186, 5766, 178746, 5541126, 171774906, 5325022086, 165075684666, 5117346224646, 158637732964026, 4917769721884806, 152450861378428986, 4725976702731298566, 146505277784670255546, 4541663611324777921926
Offset: 1

Views

Author

R. H. Hardin Feb 15 2013

Keywords

Comments

Column 2 of A222340

Examples

			Some solutions for n=3
..0..4....0..4....0..1....0..3....0..4....0..0....0..4....0..1....0..3....0..0
..1..6....3..1....5..3....5..1....5..6....3..3....1..5....3..5....0..3....3..3
..3..0....5..5....5..1....1..2....5..1....0..0....4..6....5..1....1..6....5..0
		

Formula

Empirical: a(n) = 31*a(n-1)