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.

A241329 Number of 2 X n 0..3 arrays with no element equal to fewer vertical neighbors than horizontal neighbors, with new values 0..3 introduced in row major order.

This page as a plain text file.
%I A241329 #8 Oct 29 2018 15:51:05
%S A241329 2,8,59,530,4877,45057,416533,3851085,35606121,329205872,3043762177,
%T A241329 28141931363,260193887579,2405693427789,22242493569775,
%U A241329 205649030142198,1901384099152245,17579764368539693,162538497819201097
%N A241329 Number of 2 X n 0..3 arrays with no element equal to fewer vertical neighbors than horizontal neighbors, with new values 0..3 introduced in row major order.
%H A241329 R. H. Hardin, <a href="/A241329/b241329.txt">Table of n, a(n) for n = 1..210</a>
%F A241329 Empirical: a(n) = 12*a(n-1) - 26*a(n-2) + 2*a(n-3) + 28*a(n-4) - 6*a(n-5) - 9*a(n-6) for n>8.
%F A241329 Empirical g.f.: x*(2 - 16*x + 15*x^2 + 26*x^3 - 21*x^4 - 17*x^5 + 5*x^6 + 3*x^7) / ((1 - x)*(1 - x - x^2)*(1 - 10*x + 6*x^2 + 9*x^3)). - _Colin Barker_, Oct 29 2018
%e A241329 Some solutions for n=4:
%e A241329 ..0..1..2..1....0..1..2..3....0..1..2..3....0..0..1..2....0..1..2..3
%e A241329 ..1..2..1..0....3..0..3..0....2..3..1..3....0..0..1..3....3..1..3..2
%Y A241329 Row 2 of A241328.
%K A241329 nonn
%O A241329 1,1
%A A241329 _R. H. Hardin_, Apr 19 2014