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.

A205252 Number of (n+1)X6 0..1 arrays with the number of clockwise edge increases in every 2X2 subblock the same.

Original entry on oeis.org

976, 15568, 253072, 4136296, 67731268, 1109832184, 18189909484, 298154846440, 4887277903816, 80111933563468, 1313194979326324, 21525927546323464, 352853780193705268, 5783993041849734796, 94811448308361126868
Offset: 1

Views

Author

R. H. Hardin Jan 24 2012

Keywords

Comments

Column 5 of A205255

Examples

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

Formula

Empirical: a(n) = 31*a(n-1) -321*a(n-2) +1569*a(n-3) -4179*a(n-4) +6420*a(n-5) -5671*a(n-6) +2668*a(n-7) -516*a(n-8)