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.

A223058 Number of nX4 0..3 arrays with all horizontally or vertically connected equal values in a straight line, and new values 0..3 introduced in row major order.

Original entry on oeis.org

15, 1473, 213469, 31331820, 4606719559, 677531592132, 99653055754459, 14657362298142480, 2155865978887475959, 317093854966287823308, 46639503202294456685971, 6859935143940031077127272
Offset: 1

Views

Author

R. H. Hardin Mar 13 2013

Keywords

Comments

Column 4 of A223062

Examples

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

Formula

Empirical: a(n) = 200*a(n-1) -8673*a(n-2) +135916*a(n-3) -736271*a(n-4) -465544*a(n-5) +16580061*a(n-6) -48454316*a(n-7) +18185748*a(n-8) +126046080*a(n-9) -200199168*a(n-10) +88915968*a(n-11) for n>12