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.

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

Original entry on oeis.org

256, 114244, 50999956, 22767656980, 10164078082036, 4537511642094436, 2025664524518719732, 904309916809657591444, 403707729455406641892052, 180225747607432250658675940, 80457513519867024627155058004
Offset: 1

Views

Author

R. H. Hardin Feb 09 2013

Keywords

Comments

Column 5 of A222144

Examples

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

Formula

Empirical: a(n) = 542*a(n-1) -45648*a(n-2) +1362782*a(n-3) -14182035*a(n-4) -10420216*a(n-5) +672452128*a(n-6) -1495546560*a(n-7)