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.

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

Original entry on oeis.org

4, 52, 676, 8788, 114244, 1485172, 19307236, 250994068, 3262922884, 42417997492, 551433967396, 7168641576148, 93192340489924, 1211500426369012, 15749505542797156, 204743572056363028, 2661666436732719364
Offset: 1

Views

Author

R. H. Hardin Feb 09 2013

Keywords

Comments

Column 2 of A222144

Examples

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

Formula

Empirical: a(n) = 13*a(n-1)