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.

A234119 Number of (n+1)X(5+1) 0..2 arrays with every 2X2 subblock having the absolute values of all six edge and diagonal differences no larger than 1.

Original entry on oeis.org

14527, 1082977, 79003521, 5807422543, 427196005695, 31446640848897, 2315408571668225, 170502665692732079, 12556134956123911615, 924677153131389366689, 68097056429203867060865, 5014969801413653091728655
Offset: 1

Views

Author

R. H. Hardin, Dec 19 2013

Keywords

Comments

Column 5 of A234122

Examples

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

Formula

Empirical: a(n) = 104*a(n-1) -1893*a(n-2) -33284*a(n-3) +535522*a(n-4) +4829920*a(n-5) -36672922*a(n-6) -308181352*a(n-7) +266551299*a(n-8) +4516883912*a(n-9) +2174714575*a(n-10) -20675388468*a(n-11) -11598332564*a(n-12) +40919536464*a(n-13) +9741869952*a(n-14) -32943946752*a(n-15) +6233518080*a(n-16) +2468413440*a(n-17)