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.

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

This page as a plain text file.
%I A206237 #9 May 11 2014 17:52:27
%S A206237 294546,943584,3503136,95322432,1122086640,22535636736,649065145152,
%T A206237 8026428934128,163621204516992,4735717646406528,58825697658136176,
%U A206237 1199179807904946432,34708074630513355776,431133538136479945968
%N A206237 Number of (n+1) X 8 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly two equal edges, and new values 0..3 introduced in row major order.
%C A206237 Column 7 of A206238.
%H A206237 R. H. Hardin, <a href="/A206237/b206237.txt">Table of n, a(n) for n = 1..210</a>
%F A206237 Empirical: a(n) = a(n-1) +7329*a(n-3) -7329*a(n-4) for n>11.
%e A206237 Some solutions for n=4:
%e A206237 ..0..0..1..2..2..3..0..3....0..0..1..1..0..1..1..2....0..0..1..0..0..1..2..0
%e A206237 ..0..1..2..2..1..0..0..3....2..2..3..1..1..2..1..1....0..3..0..0..1..2..2..0
%e A206237 ..3..2..2..3..0..0..1..2....3..2..2..3..1..1..2..1....1..0..0..3..2..2..0..1
%e A206237 ..2..2..3..0..0..1..2..2....0..1..2..2..0..1..1..2....0..0..3..2..2..3..1..1
%e A206237 ..1..1..0..0..3..2..2..1....0..0..3..2..2..3..1..1....1..1..2..2..3..1..1..3
%K A206237 nonn
%O A206237 1,1
%A A206237 _R. H. Hardin_, Feb 05 2012