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.

A214111 Number of 0..3 colorings on an n X 8 array circular in the 8 direction with new values 0..3 introduced in row major order.

Original entry on oeis.org

274, 241021, 214404272, 191154162535, 170522196557894, 152139337430979981, 135743316919977662412, 121115464757399493650995, 108064195911838596360133794, 96419379334610535129230711641
Offset: 1

Views

Author

R. H. Hardin, Jul 04 2012

Keywords

Comments

Column 7 of A214112.

Examples

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

Crossrefs

Cf. A214112.

Formula

Empirical: a(n) = 1203*a(n-1) -297573*a(n-2) +18493097*a(n-3) -335304937*a(n-4) -2841739689*a(n-5) +143852359466*a(n-6) -1534038361818*a(n-7) +6617547976377*a(n-8) -7661483975363*a(n-9) -26503966569309*a(n-10) +78166619202873*a(n-11) -32671121962535*a(n-12) -67703780939087*a(n-13) +56706284940528*a(n-14) -5556753823232*a(n-15).