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.

A205251 Number of (n+1) X 5 0..1 arrays with the number of clockwise edge increases in every 2 X 2 subblock the same.

This page as a plain text file.
%I A205251 #8 Jun 11 2018 08:18:23
%S A205251 328,3416,36304,387328,4136296,44183032,471988176,5042151648,
%T A205251 53864590280,575428804376,6147238485232,65670238411328,
%U A205251 701547599923496,7494552376793144,80063441950649104,855308552375931040
%N A205251 Number of (n+1) X 5 0..1 arrays with the number of clockwise edge increases in every 2 X 2 subblock the same.
%C A205251 Column 4 of A205255.
%H A205251 R. H. Hardin, <a href="/A205251/b205251.txt">Table of n, a(n) for n = 1..210</a>
%F A205251 Empirical: a(n) = 17*a(n-1) - 81*a(n-2) + 157*a(n-3) - 140*a(n-4) + 56*a(n-5) - 8*a(n-6).
%F A205251 Empirical g.f.: 8*x*(41 - 270*x + 600*x^2 - 580*x^3 + 244*x^4 - 36*x^5) / ((1 - x)*(1 - 16*x + 65*x^2 - 92*x^3 + 48*x^4 - 8*x^5)). - _Colin Barker_, Jun 11 2018
%e A205251 Some solutions for n=4:
%e A205251 ..1..0..0..0..0....0..0..1..0..0....0..0..0..1..0....0..0..0..1..0
%e A205251 ..1..1..0..1..0....0..1..1..1..0....1..1..0..1..0....0..1..0..0..0
%e A205251 ..1..0..0..1..1....0..0..0..1..0....0..0..0..0..0....1..1..0..1..0
%e A205251 ..1..1..1..1..0....1..0..1..1..0....1..1..0..1..0....0..0..0..0..0
%e A205251 ..0..0..1..0..0....1..1..1..0..0....1..0..0..1..0....1..1..1..0..1
%Y A205251 Cf. A205255.
%K A205251 nonn
%O A205251 1,1
%A A205251 _R. H. Hardin_, Jan 24 2012