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.

A265229 Number of n X 2 arrays containing 2 copies of 0..n-1 with no equal vertical neighbors and new values introduced sequentially from 0.

Original entry on oeis.org

1, 2, 7, 43, 372, 4027, 51871, 773186, 13083385, 247698481, 5186925696, 119023766737, 2969884019977, 80056947698498, 2318432654628847, 71785166633148187, 2366425763631216756, 82748313392542136011
Offset: 1

Views

Author

R. H. Hardin, Dec 06 2015

Keywords

Examples

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

Crossrefs

Column 2 of A265232.