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.

A205190 Number of (n+1) X 6 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 A205190 #8 Jun 11 2018 04:18:14
%S A205190 144,168,292,384,736,896,1568,1920,3392,4224,7520,9344,16608,20608,
%T A205190 36608,45440,80736,100224,178080,221056,392768,487552,866272,1075328,
%U A205190 1910624,2371712,4214016,5230976,9294304,11537280,20499232,25446272,45212480
%N A205190 Number of (n+1) X 6 0..1 arrays with the number of clockwise edge increases in every 2 X 2 subblock differing from each horizontal or vertical neighbor.
%C A205190 Column 5 of A205193.
%H A205190 R. H. Hardin, <a href="/A205190/b205190.txt">Table of n, a(n) for n = 1..210</a>
%F A205190 Empirical: a(n) = 2*a(n-2) +a(n-6) for n>9.
%F A205190 Empirical g.f.: 4*x*(36 + 42*x + x^2 + 12*x^3 + 38*x^4 + 32*x^5 - 12*x^6 - 10*x^7 - 9*x^8) / (1 - 2*x^2 - x^6). - _Colin Barker_, Jun 11 2018
%e A205190 Some solutions for n=4:
%e A205190 ..0..0..1..1..0..0....0..0..1..1..1..0....0..0..1..0..0..0....0..1..1..0..0..1
%e A205190 ..0..0..1..1..0..0....1..1..0..1..1..1....0..1..0..0..0..1....0..1..1..0..0..0
%e A205190 ..1..1..0..0..1..1....1..1..1..0..1..1....1..0..0..0..1..0....1..0..0..1..0..0
%e A205190 ..1..1..0..0..1..1....0..1..1..1..0..0....0..0..0..1..0..0....1..0..0..0..1..0
%e A205190 ..1..0..1..1..0..1....1..0..1..1..0..0....0..0..1..0..0..0....0..1..0..0..0..1
%Y A205190 Cf. A205193.
%K A205190 nonn
%O A205190 1,1
%A A205190 _R. H. Hardin_, Jan 23 2012