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.

A239538 Number of (4+1)X(n+1) 0..2 arrays with no element equal to all horizontal neighbors or unequal to all vertical neighbors, and new values 0..2 introduced in row major order.

Original entry on oeis.org

13, 68, 1014, 11108, 131988, 1533792, 17931608, 209295248, 2443954640, 28534764096, 333172950560, 3890104752256, 45420709489664, 530330059963392, 6192109859155200, 72298791884174336, 844157402919585408
Offset: 1

Views

Author

R. H. Hardin, Mar 21 2014

Keywords

Comments

Row 4 of A239537

Examples

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

Formula

Empirical: a(n) = 8*a(n-1) +46*a(n-2) -22*a(n-3) -166*a(n-4) +28*a(n-5) +68*a(n-6) +208*a(n-7) -160*a(n-8) -48*a(n-9) +32*a(n-10)