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.

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

Original entry on oeis.org

2401, 23931607, 238535974201, 2377584520856755, 23698346512668445387, 236211004301185098853381, 2354410613553773007691517269, 23467362808156794232691794722151, 233908696299327013910964536639599807
Offset: 1

Views

Author

R. H. Hardin Feb 21 2013

Keywords

Comments

Column 5 of A222462

Examples

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

Formula

Empirical: a(n) = 10754*a(n-1) -8060499*a(n-2) +2219242223*a(n-3) -245682627864*a(n-4) +5798947687589*a(n-5) +448113231493438*a(n-6) -2763020698450992*a(n-7)