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.

A232371 Number of nX3 0..3 arrays with every 0 next to a 1, every 1 next to a 2 and every 2 next to a 3 horizontally, diagonally or antidiagonally, and no adjacent values equal.

Original entry on oeis.org

4, 74, 586, 4550, 36574, 292122, 2324142, 18574882, 148225606, 1182879814, 9441116934, 75346596778, 601334070966, 4799220047514, 38302112010658, 305686073938078, 2439655331781498, 19470682813562030, 155393901867403394
Offset: 1

Views

Author

R. H. Hardin, Nov 23 2013

Keywords

Comments

Column 3 of A232376

Examples

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

Formula

Empirical: a(n) = 4*a(n-1) +17*a(n-2) +74*a(n-3) +170*a(n-4) +1012*a(n-5) +2868*a(n-6) +3592*a(n-7) +4816*a(n-8) +5356*a(n-9) +6245*a(n-10) +4504*a(n-11) +2633*a(n-12) +954*a(n-13) +756*a(n-14) +216*a(n-15)