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.

A205747 Number of (n+1)X3 0..2 arrays with every 2X2 subblock having the same number of equal edges as its horizontal neighbors and a different number from its vertical neighbors, and new values 0..2 introduced in row major order.

This page as a plain text file.
%I A205747 #7 Jul 22 2025 18:59:48
%S A205747 48,284,1936,12384,82992,542718,3602578,23691830,156738676,1033041690,
%T A205747 6824741078,45020426618,297261797768,1961609742846,12949334504402,
%U A205747 85463493135422,564128280317020,3723357621326818,24576331604189646
%N A205747 Number of (n+1)X3 0..2 arrays with every 2X2 subblock having the same number of equal edges as its horizontal neighbors and a different number from its vertical neighbors, and new values 0..2 introduced in row major order.
%C A205747 Column 2 of A205753
%H A205747 R. H. Hardin, <a href="/A205747/b205747.txt">Table of n, a(n) for n = 1..210</a>
%F A205747 Empirical: a(n) = 33*a(n-2) +76*a(n-3) +13*a(n-4) -284*a(n-5) -597*a(n-6) +484*a(n-7) +1376*a(n-8) +36*a(n-9) -752*a(n-10) -256*a(n-11) for n>12
%e A205747 Some solutions for n=4
%e A205747 ..0..1..2....0..0..0....0..0..1....0..1..0....0..0..0....0..0..0....0..0..1
%e A205747 ..0..1..2....0..1..0....2..0..1....0..0..0....0..0..0....1..2..1....0..1..1
%e A205747 ..1..2..1....1..2..1....0..1..0....1..2..1....0..1..0....1..1..1....2..2..0
%e A205747 ..2..2..1....2..2..1....1..1..0....0..1..2....1..2..1....1..1..1....1..2..0
%e A205747 ..1..0..0....1..0..0....0..2..2....0..1..1....2..2..1....1..2..1....2..1..2
%K A205747 nonn
%O A205747 1,1
%A A205747 _R. H. Hardin_ Jan 30 2012