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.

A217452 Number of n X 3 arrays of the minimum value of corresponding elements and their horizontal and vertical neighbors in a random 0..2 n X 3 array.

Original entry on oeis.org

9, 69, 613, 4361, 35067, 271863, 2122623, 16577231, 129398981, 1010161409, 7886865189, 61570433261, 480690831603, 3752745812035, 29297882184787, 228729463311571, 1785699822954649, 13941021624348057, 108838075075791297
Offset: 1

Views

Author

R. H. Hardin, Oct 03 2012

Keywords

Comments

Column 3 of A217457.

Examples

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

Crossrefs

Cf. A217457.