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.

A214102 Number of 0..2 colorings of a 3X(n+1) array circular in the n+1 direction with new values 0..2 introduced in row major order.

This page as a plain text file.
%I A214102 #8 Jul 22 2025 23:07:18
%S A214102 9,4,121,180,2041,5068,37441,121588,722009,2720828,14363985,58850116,
%T A214102 291217929,1250645324,5970338241,26327622356,123189300217,
%U A214102 551369047260,2551171130801,11514142774628,52942859314409,240066004887660
%N A214102 Number of 0..2 colorings of a 3X(n+1) array circular in the n+1 direction with new values 0..2 introduced in row major order.
%C A214102 Row 3 of A214101
%H A214102 R. H. Hardin, <a href="/A214102/b214102.txt">Table of n, a(n) for n = 1..210</a>
%F A214102 Empirical: a(n) = 3*a(n-1) +15*a(n-2) -33*a(n-3) -22*a(n-4) +38*a(n-5) +8*a(n-6) -8*a(n-7).
%F A214102 Empirical: G.f. -x*(2*x^2-1)*(8*x^3-8*x^2-23*x+9) / ( (x-1)*(2*x-1)*(1+x)*(2*x^2-5*x+1)*(2*x^2+4*x+1) ). - _R. J. Mathar_, Jul 04 2012
%e A214102 Some solutions for n=4
%e A214102 ..0..1..0..2..1....0..1..0..1..2....0..1..2..0..1....0..1..2..0..1
%e A214102 ..1..2..1..0..2....2..0..2..0..1....2..0..1..2..0....1..2..1..2..0
%e A214102 ..0..1..0..2..1....0..1..0..1..2....0..1..2..1..2....2..0..2..0..1
%K A214102 nonn
%O A214102 1,1
%A A214102 _R. H. Hardin_ Jul 04 2012