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.

A206617 Number of (n+1)X5 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 A206617 #7 Jul 22 2025 19:33:05
%S A206617 4035,270869,21744156,1719525751,135010973857,10633148505553,
%T A206617 837071761231340,65890955765683798,5187056339251009089,
%U A206617 408327809631129343522,32143691853804370071056,2530367382763227289642909
%N A206617 Number of (n+1)X5 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 A206617 Column 4 of A206621
%H A206617 R. H. Hardin, <a href="/A206617/b206617.txt">Table of n, a(n) for n = 1..210</a>
%e A206617 Some solutions for n=4
%e A206617 ..0..1..0..2..1....0..0..0..1..2....0..0..0..1..0....0..0..0..0..0
%e A206617 ..1..1..2..1..1....2..0..2..0..1....2..0..1..2..0....1..2..1..2..1
%e A206617 ..2..1..0..1..0....1..2..0..0..1....1..2..0..2..1....2..1..2..1..0
%e A206617 ..1..2..2..2..1....2..2..0..1..0....1..2..0..1..2....1..0..0..2..1
%e A206617 ..1..0..1..0..1....2..0..2..0..0....2..0..2..1..2....1..2..1..1..2
%K A206617 nonn
%O A206617 1,1
%A A206617 _R. H. Hardin_ Feb 10 2012