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.

A241330 Number of 3Xn 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 A241330 #6 Jul 23 2025 11:12:42
%S A241330 5,85,2344,68935,2034543,60066019,1773370241,52356524981,
%T A241330 1545760698649,45636645554004,1347364712395962,39779252976746762,
%U A241330 1174432544392935470,34673647645893709738,1023695951556996550068,30223338828856554979455
%N A241330 Number of 3Xn 0..3 arrays with no element equal to fewer vertical neighbors than horizontal neighbors, with new values 0..3 introduced in row major order.
%C A241330 Row 3 of A241328
%H A241330 R. H. Hardin, <a href="/A241330/b241330.txt">Table of n, a(n) for n = 1..210</a>
%F A241330 Empirical: a(n) = 31*a(n-1) -26*a(n-2) -530*a(n-3) +271*a(n-4) +1431*a(n-5) +437*a(n-6) +157*a(n-7) -438*a(n-8) -846*a(n-9) -243*a(n-10) -243*a(n-11) for n>13
%e A241330 Some solutions for n=4
%e A241330 ..0..1..0..2....0..1..2..1....0..1..2..1....0..1..0..1....0..1..2..3
%e A241330 ..0..1..1..2....3..1..3..2....3..0..3..0....2..3..1..1....1..1..3..2
%e A241330 ..1..3..1..0....1..0..3..1....0..2..1..3....1..3..1..0....1..0..1..3
%K A241330 nonn
%O A241330 1,1
%A A241330 _R. H. Hardin_, Apr 19 2014