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.

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

Original entry on oeis.org

1296, 5541126, 23691810366, 101297497221786, 433110977725751106, 1851823828949372226486, 7917720099292335726179166, 33853269728349231756633211146, 144744175965862513604773406152386
Offset: 1

Views

Author

R. H. Hardin Feb 15 2013

Keywords

Comments

Column 5 of A222340

Examples

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

Formula

Empirical: a(n) = 4726*a(n-1) -1996686*a(n-2) +308276506*a(n-3) -18629904781*a(n-4) +185850985068*a(n-5) +13276501451568*a(n-6) -66007323700200*a(n-7)