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.

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

Original entry on oeis.org

3125, 20420505, 133450391205, 872117822449905, 5699418948690910545, 37246546285522069805565, 243411692308741298296892325, 1590731433240496702463084026185, 10395665338455031917089762271340425
Offset: 1

Views

Author

R. H. Hardin Feb 14 2013

Keywords

Comments

Column 6 of A222281

Examples

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

Formula

Empirical: a(n) = 7938*a(n-1) -9943008*a(n-2) +5278092573*a(n-3) -1416161397945*a(n-4) +189661760461122*a(n-5) -8951148305934130*a(n-6) -487109953871878605*a(n-7) +56895718084769745618*a(n-8) -830858693461616784042*a(n-9) -28335983890061186407242*a(n-10) +900964564966870530468786*a(n-11) -8459179431248677153169700*a(n-12) +25270987327038335804651100*a(n-13)