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.

A208869 Number of nX5 0..3 arrays with new values 0..3 introduced in row major order and no element equal to more than one of its immediate leftward or upward or right-upward antidiagonal neighbors.

Original entry on oeis.org

51, 24472, 14493405, 8624977114, 5134914951163, 3057224057476808, 1820216057105650386, 1083724145919960847502, 645230025599333921071976, 384158448692090971917060268, 228721088397696942173901117684
Offset: 1

Views

Author

R. H. Hardin Mar 02 2012

Keywords

Comments

Column 5 of A208872

Examples

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

Formula

Empirical: a(n) = 698*a(n-1) -64930*a(n-2) +2349972*a(n-3) -40985428*a(n-4) +382137700*a(n-5) -2071312484*a(n-6) +7427716824*a(n-7) -22247002672*a(n-8) +65755191408*a(n-9) -163887803568*a(n-10) +277785052512*a(n-11) -285817496832*a(n-12) +164238606720*a(n-13) -46819296000*a(n-14) +4897760256*a(n-15) for n>16