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.

A205189 Number of (n+1) X 5 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 A205189 #8 Jun 11 2018 04:18:06
%S A205189 72,104,160,256,384,576,864,1312,1984,3008,4544,6880,10400,15744,
%T A205189 23808,36032,54496,82464,124736,188736,285504,431968,653472,988672,
%U A205189 1495680,2262848,3423328,5179168,7835328,11854016,17933504,27131360,41046176
%N A205189 Number of (n+1) X 5 0..1 arrays with the number of clockwise edge increases in every 2 X 2 subblock differing from each horizontal or vertical neighbor.
%C A205189 Column 4 of A205193.
%H A205189 R. H. Hardin, <a href="/A205189/b205189.txt">Table of n, a(n) for n = 1..210</a>
%F A205189 Empirical: a(n) = a(n-1) +a(n-2) -a(n-3) +a(n-4) for n>6.
%F A205189 Empirical g.f.: 8*x*(9 + 4*x - 2*x^2 + 8*x^3 - x^5) / (1 - x - x^2 + x^3 - x^4). - _Colin Barker_, Jun 11 2018
%e A205189 Some solutions for n=4:
%e A205189 ..1..1..0..1..1....1..1..0..1..1....1..1..1..0..1....1..0..1..1..0
%e A205189 ..1..1..1..0..1....1..1..1..0..1....1..1..0..1..1....0..1..1..1..0
%e A205189 ..0..1..1..1..0....0..1..1..1..0....0..0..1..1..1....1..1..1..0..1
%e A205189 ..1..0..1..1..1....1..0..1..1..0....0..0..1..1..0....1..1..0..1..1
%e A205189 ..1..1..0..1..1....1..1..0..0..1....0..1..0..0..1....0..0..1..1..1
%Y A205189 Cf. A205193.
%K A205189 nonn
%O A205189 1,1
%A A205189 _R. H. Hardin_, Jan 23 2012