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.

A205315 Number of (n+1)X6 0..1 arrays with every 2X2 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 A205315 #7 Jul 22 2025 18:46:47
%S A205315 488,7784,126536,2068148,33865634,554916092,9094954742,149077423220,
%T A205315 2443638951908,40055966781734,656597489663162,10762963773161732,
%U A205315 176426890096852634,2891996520924867398,47405724154180563434
%N A205315 Number of (n+1)X6 0..1 arrays with every 2X2 subblock having the same number of equal edges, and new values 0..1 introduced in row major order.
%C A205315 Column 5 of A205318
%H A205315 R. H. Hardin, <a href="/A205315/b205315.txt">Table of n, a(n) for n = 1..210</a>
%F A205315 Empirical: a(n) = 31*a(n-1) -321*a(n-2) +1569*a(n-3) -4179*a(n-4) +6420*a(n-5) -5671*a(n-6) +2668*a(n-7) -516*a(n-8)
%e A205315 Some solutions for n=4
%e A205315 ..0..1..1..1..0..1....0..1..1..1..1..1....0..1..0..0..1..0....0..0..0..1..0..0
%e A205315 ..1..1..0..1..0..1....1..1..0..1..0..1....1..1..0..1..1..1....1..0..1..1..1..1
%e A205315 ..1..0..0..0..0..1....0..1..1..1..1..1....0..1..1..1..0..1....1..1..1..0..0..1
%e A205315 ..0..0..1..0..1..1....1..1..0..0..1..0....0..1..0..0..0..1....0..1..0..0..1..1
%e A205315 ..1..0..1..1..1..0....0..0..0..1..1..0....0..1..1..1..1..1....1..1..0..1..1..0
%K A205315 nonn
%O A205315 1,1
%A A205315 _R. H. Hardin_ Jan 25 2012