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.

A222442 Number of n X 6 0..3 arrays with entries increasing mod 4 by 0, 1 or 2 rightwards and downwards, starting with upper left zero.

Original entry on oeis.org

243, 50421, 10499787, 2187822609, 455924913093, 95013316876491, 19800569621116647, 4126399930787828049, 859933842854600077173, 179208573795933519199311, 37346725549299749805268107
Offset: 1

Views

Author

R. H. Hardin, Feb 20 2013

Keywords

Comments

Column 6 of A222444.

Examples

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

Crossrefs

Cf. A222444.

Formula

Empirical: a(n) = 312*a(n-1) -25524*a(n-2) +890339*a(n-3) -15323331*a(n-4) +129432870*a(n-5) -387838226*a(n-6) -1530469395*a(n-7) +14599631124*a(n-8) -35234863780*a(n-9) +5987707122*a(n-10) +87399541374*a(n-11) -99581148396*a(n-12) +21008679048*a(n-13).