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.

A222278 Number of nX5 0..5 arrays with no entry increasing mod 6 by 5 rightwards or downwards, starting with upper left zero.

Original entry on oeis.org

625, 972405, 1513010465, 2354171487645, 3662978221194885, 5699418948690910545, 8868023343395876315745, 13798220262404977892742445, 21469370911390982766132649045, 33405314494566540518963638820105
Offset: 1

Views

Author

R. H. Hardin Feb 14 2013

Keywords

Comments

Column 5 of A222281

Examples

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

Formula

Empirical: a(n) = 1784*a(n-1) -372607*a(n-2) +28170251*a(n-3) -798596554*a(n-4) +1889917225*a(n-5) +177172468750*a(n-6) -651776500000*a(n-7)