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.

A214103 Number of 0..2 colorings of a 4X(n+1) array circular in the n+1 direction with new values 0..2 introduced in row major order.

Original entry on oeis.org

27, 8, 771, 1080, 29540, 79968, 1241355, 4807928, 54733587, 263068168, 2491174972, 13706830176, 115900489291, 694854606408, 5473717429995, 34661887488856, 261125940394148, 1712290280769888, 12540109248690731, 84080392667812248
Offset: 1

Views

Author

R. H. Hardin Jul 04 2012

Keywords

Comments

Row 4 of A214101

Examples

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

Formula

Empirical: a(n) = 8*a(n-1) +26*a(n-2) -304*a(n-3) +304*a(n-4) +2016*a(n-5) -3991*a(n-6) -2616*a(n-7) +9702*a(n-8) -2064*a(n-9) -6120*a(n-10) +2880*a(n-11)