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.

A206620 Number of (n+1)X8 0..2 arrays with every 2X3 or 3X2 subblock having no more than two equal edges, and new values 0..2 introduced in row major order.

This page as a plain text file.
%I A206620 #6 Jul 24 2025 19:37:50
%S A206620 1327931,945314307,907138039901,837071761231340,765786718381692875,
%T A206620 704228581922250103909
%N A206620 Number of (n+1)X8 0..2 arrays with every 2X3 or 3X2 subblock having no more than two equal edges, and new values 0..2 introduced in row major order.
%C A206620 Column 7 of A206621
%e A206620 Some solutions for n=4
%e A206620 ..0..0..0..1..2..1..2..2....0..0..0..0..1..0..0..1....0..1..2..1..2..1..2..1
%e A206620 ..1..2..1..2..2..2..0..0....1..2..1..2..1..2..1..0....1..0..1..1..0..1..1..2
%e A206620 ..2..1..2..0..1..0..1..2....0..0..0..0..1..0..2..1....0..2..1..2..1..0..0..1
%e A206620 ..2..0..2..2..0..1..2..1....1..2..1..2..0..1..2..0....1..0..2..0..2..2..1..2
%e A206620 ..2..1..2..1..2..2..1..1....0..1..2..0..2..0..2..1....2..2..1..1..1..0..0..2
%K A206620 nonn
%O A206620 1,1
%A A206620 _R. H. Hardin_ Feb 10 2012