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.

A241105 Number of nX5 0..2 arrays with no element equal to one or three horizontal or vertical neighbors, with new values 0..2 introduced in row major order.

Original entry on oeis.org

8, 116, 1522, 19814, 259388, 3374086, 44030862, 574246744, 7489718098, 97685897406, 1274061880332, 16617079770494, 216729255718838, 2826706576812536, 36867513064014682, 480847045785788134
Offset: 1

Views

Author

R. H. Hardin, Apr 16 2014

Keywords

Comments

Column 5 of A241108

Examples

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

Formula

Empirical: a(n) = 14*a(n-1) +2*a(n-2) -175*a(n-3) -54*a(n-4) +1648*a(n-5) -42588*a(n-6) -24344*a(n-7) +167248*a(n-8) +247904*a(n-9) -88832*a(n-10) +33429248*a(n-11) +48635904*a(n-12) +27281408*a(n-13) -32276480*a(n-14) -600080384*a(n-15) -9134145536*a(n-16) -11089739776*a(n-17) -2071986176*a(n-18) +11282677760*a(n-19) +94019518464*a(n-20) +716320014336*a(n-21) +518617300992*a(n-22) +438086664192*a(n-23) +618475290624*a(n-24) -6597069766656*a(n-25) -17592186044416*a(n-26)