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.

A183598 1/6 the number of (n+1)X5 0..2 arrays with every 2X2 subblock containing all three values.

Original entry on oeis.org

534, 10797, 201770, 3831324, 72592860, 1376627608, 26108240340, 495215814566, 9393691937690, 178194216929170, 3380332407037684, 64125402470512942, 1216476053110547726, 23076960013228726054, 437778595866783333858
Offset: 1

Views

Author

R. H. Hardin Jan 05 2011

Keywords

Comments

Column 4 of A183603

Examples

			Some solutions with a(1,1)=0 for 3X5
..0..2..0..2..1....0..2..1..1..2....0..2..1..1..0....0..0..0..1..2
..0..1..1..0..0....1..1..0..2..0....1..0..2..0..2....2..1..2..1..0
..2..2..0..2..1....0..2..1..1..1....1..2..1..2..1....1..0..0..0..2
		

Formula

Empirical: a(n)=29*a(n-1)-116*a(n-2)-2075*a(n-3)+10702*a(n-4)+51511*a(n-5)-261497*a(n-6)-510094*a(n-7)+2707193*a(n-8)+1565260*a(n-9)-12569843*a(n-10)+2644843*a(n-11)+22771798*a(n-12)-13641330*a(n-13)-14269732*a(n-14)+12528656*a(n-15)+1720808*a(n-16)-3240288*a(n-17)+392640*a(n-18)+109056*a(n-19)