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.

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

This page as a plain text file.
%I A206232 #7 Jul 22 2025 19:20:15
%S A206232 60,256,1136,5728,31652,170728,943584,5175034,28475596,156707492,
%T A206232 861735284,4742758462,26087819020,143545024690,789722083016,
%U A206232 4344918701514,23904948840000,131519096655384,723594734816028
%N A206232 Number of (n+1)X3 0..3 arrays with every 2X3 or 3X2 subblock having exactly two equal edges, and new values 0..3 introduced in row major order.
%C A206232 Column 2 of A206238
%H A206232 R. H. Hardin, <a href="/A206232/b206232.txt">Table of n, a(n) for n = 1..210</a>
%F A206232 Empirical: a(n) = 3*a(n-1) +20*a(n-2) -14*a(n-3) -133*a(n-4) +95*a(n-5) +123*a(n-6) +9*a(n-7) -102*a(n-8) for n>10
%e A206232 Some solutions for n=4
%e A206232 ..0..0..0....0..0..0....0..1..1....0..0..0....0..0..0....0..1..0....0..0..0
%e A206232 ..1..2..1....1..2..1....2..3..3....1..2..1....1..2..3....0..1..1....1..2..1
%e A206232 ..1..3..1....1..3..1....3..3..2....1..3..1....1..0..3....1..2..1....1..0..1
%e A206232 ..1..0..1....1..0..1....0..0..3....1..2..1....1..2..3....1..1..2....1..2..1
%e A206232 ..1..2..1....2..2..1....1..0..0....3..3..1....0..0..3....3..1..2....3..3..3
%K A206232 nonn
%O A206232 1,1
%A A206232 _R. H. Hardin_ Feb 05 2012