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.

A205313 Number of (n+1) X 4 0..1 arrays with every 2 X 2 subblock having the same number of equal edges, and new values 0..1 introduced in row major order.

This page as a plain text file.
%I A205313 #8 Jun 11 2018 09:26:27
%S A205313 56,376,2606,18152,126536,882182,6150512,42881096,298965278,
%T A205313 2084374136,14532174632,101317751318,706383387200,4924877262824,
%U A205313 34336051065326,239389600968776,1669014906316040,11636306448704678,81127872049414160
%N A205313 Number of (n+1) X 4 0..1 arrays with every 2 X 2 subblock having the same number of equal edges, and new values 0..1 introduced in row major order.
%C A205313 Column 3 of A205318.
%H A205313 R. H. Hardin, <a href="/A205313/b205313.txt">Table of n, a(n) for n = 1..210</a>
%F A205313 Empirical: a(n) = 10*a(n-1) -24*a(n-2) +21*a(n-3) -6*a(n-4).
%F A205313 Empirical g.f.: 2*x*(2 - 3*x)*(14 - 25*x + 10*x^2) / ((1 - x)*(1 - 9*x + 15*x^2 - 6*x^3)). - _Colin Barker_, Jun 11 2018
%e A205313 Some solutions for n=4:
%e A205313 ..0..1..0..1....0..1..1..0....0..0..0..0....0..0..1..1....0..0..1..0
%e A205313 ..1..1..1..1....1..1..0..0....0..1..1..0....0..1..1..0....0..1..1..1
%e A205313 ..0..1..0..0....0..0..0..1....1..1..0..0....0..0..0..0....1..1..0..0
%e A205313 ..0..0..0..1....0..1..1..1....1..0..0..1....0..1..1..0....1..0..0..1
%e A205313 ..1..1..1..1....0..1..0..0....1..1..0..1....1..1..0..0....0..0..1..1
%Y A205313 Cf. A205318.
%K A205313 nonn
%O A205313 1,1
%A A205313 _R. H. Hardin_, Jan 25 2012