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.

A205191 Number of (n+1) X 7 0..1 arrays with the number of clockwise edge increases in every 2 X 2 subblock differing from each horizontal or vertical neighbor.

This page as a plain text file.
%I A205191 #8 Jun 11 2018 04:18:21
%S A205191 216,272,384,576,896,1408,2048,2944,4224,6144,8960,13184,19328,28416,
%T A205191 41600,61056,89344,131072,191872,281472,412160,604544,885376,1298432,
%U A205191 1901824,2788736,4085120,5989632,8774784,12864640,18848000,27631104
%N A205191 Number of (n+1) X 7 0..1 arrays with the number of clockwise edge increases in every 2 X 2 subblock differing from each horizontal or vertical neighbor.
%C A205191 Column 6 of A205193.
%H A205191 R. H. Hardin, <a href="/A205191/b205191.txt">Table of n, a(n) for n = 1..210</a>
%F A205191 Empirical: a(n) = a(n-1) +a(n-2) -a(n-3) +a(n-4) -a(n-5) +a(n-6) for n>10.
%F A205191 Empirical g.f.: 8*x*(27 + 7*x - 13*x^2 + 17*x^3 - x^4 + 33*x^5 - x^6 - 10*x^7 - 8*x^8 - 8*x^9) / ((1 - x^2 + x^3)*(1 - x - x^3)). - _Colin Barker_, Jun 11 2018
%e A205191 Some solutions for n=4:
%e A205191 ..0..0..0..1..1..1..0....1..0..0..1..0..1..1....0..0..1..1..0..0..1
%e A205191 ..1..0..0..1..1..0..1....1..0..0..0..1..1..1....0..0..1..1..0..0..1
%e A205191 ..0..1..1..0..0..1..1....0..1..0..0..1..1..0....0..1..0..0..1..1..0
%e A205191 ..0..1..1..0..0..1..1....0..0..1..1..0..0..1....1..0..0..0..1..1..1
%e A205191 ..1..0..0..1..1..0..0....0..0..1..1..0..0..1....0..0..0..1..0..1..1
%Y A205191 Cf. A205193.
%K A205191 nonn
%O A205191 1,1
%A A205191 _R. H. Hardin_, Jan 23 2012