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.

A230065 Number of nX5 0..2 arrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value 2-x(i,j).

Original entry on oeis.org

0, 225, 3645, 281961, 14082255, 793041921, 43142680647, 2369158188849, 129763431348327, 7112485499815809, 389766441753947727, 21360486977871231969, 1170607520117723187375, 64152453401987618058561
Offset: 1

Views

Author

R. H. Hardin, Oct 08 2013

Keywords

Comments

Column 5 of A230068

Examples

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

Formula

Empirical: a(n) = 59*a(n-1) -13572*a(n-3) +53018*a(n-4) -4614*a(n-5) -84248*a(n-6) +5703584*a(n-7) -22239144*a(n-8) -30968*a(n-9) +2695936*a(n-10) -13901184*a(n-11) +54290432*a(n-12) -1462272*a(n-13) +65536*a(n-15) -1048576*a(n-16) for n>19