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.

A203485 Number of n X 2 0..2 arrays with row sums equal and column sums unequal to adjacent columns.

Original entry on oeis.org

6, 10, 36, 82, 256, 676, 2050, 5826, 17568, 51640, 155590, 463996, 1397766, 4192646, 12626836, 37955426, 114267376, 343694728, 1034313190, 3111132672, 9359196778, 28146901826, 84646727920, 254509346220, 765178882006, 2300166018706
Offset: 1

Views

Author

R. H. Hardin, Jan 02 2012

Keywords

Comments

Column 2 of A203491.

Examples

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

Crossrefs

Cf. A203491.