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.

A206619 Number of (n+1)X7 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 A206619 #7 Jul 22 2025 19:33:11
%S A206619 192358,62250328,26135187233,10633148505553,4289914143971114,
%T A206619 1738678950539792051,704228581922250103909,285197699391932223744199,
%U A206619 115508361295861948938141134,46781700029539016314279246512
%N A206619 Number of (n+1)X7 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 A206619 Column 6 of A206621
%H A206619 R. H. Hardin, <a href="/A206619/b206619.txt">Table of n, a(n) for n = 1..12</a>
%e A206619 Some solutions for n=4
%e A206619 ..0..0..1..1..0..0..1....0..1..0..2..1..2..2....0..0..0..0..0..0..1
%e A206619 ..0..2..0..2..0..1..2....1..1..0..1..2..0..0....2..1..2..1..2..1..2
%e A206619 ..1..0..2..1..1..2..2....2..0..1..2..0..0..1....0..0..2..0..2..0..1
%e A206619 ..2..2..1..0..0..1..0....1..2..0..1..2..2..0....2..1..0..1..1..1..0
%e A206619 ..1..2..1..0..1..2..0....0..1..1..2..0..1..2....1..0..1..2..1..2..1
%K A206619 nonn
%O A206619 1,1
%A A206619 _R. H. Hardin_ Feb 10 2012