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.

A239152 Number of (n+1)X(3+1) 0..3 arrays with no element equal to all horizontal neighbors or unequal to all vertical neighbors, and new values 0..3 introduced in row major order.

This page as a plain text file.
%I A239152 #6 Jul 23 2025 10:57:24
%S A239152 7,7,868,5775,209839,2709568,63961519,1049404191,21350167780,
%T A239152 381843947671,7373045875687,135997241404032,2577824537597143,
%U A239152 48074166516591223,905276493099636196,16948804700642238303
%N A239152 Number of (n+1)X(3+1) 0..3 arrays with no element equal to all horizontal neighbors or unequal to all vertical neighbors, and new values 0..3 introduced in row major order.
%C A239152 Column 3 of A239155
%H A239152 R. H. Hardin, <a href="/A239152/b239152.txt">Table of n, a(n) for n = 1..210</a>
%F A239152 Empirical: a(n) = 20*a(n-1) +86*a(n-2) -2504*a(n-3) +7634*a(n-4) +21878*a(n-5) -95663*a(n-6) +32018*a(n-7) +100940*a(n-8) -38416*a(n-9)
%e A239152 Some solutions for n=5
%e A239152 ..0..1..1..0....0..1..1..2....0..1..0..2....0..1..0..2....0..1..1..2
%e A239152 ..0..1..1..0....0..1..1..2....0..1..0..2....0..1..0..2....0..1..1..2
%e A239152 ..1..0..1..0....1..3..2..0....3..0..0..3....2..1..3..0....1..0..1..2
%e A239152 ..1..0..1..2....1..3..2..0....3..0..0..3....2..1..3..0....1..0..0..2
%e A239152 ..2..3..3..2....0..3..0..1....2..0..1..2....3..1..0..2....3..2..0..1
%e A239152 ..2..3..3..2....0..3..0..1....2..0..1..2....3..1..0..2....3..2..0..1
%K A239152 nonn
%O A239152 1,1
%A A239152 _R. H. Hardin_, Mar 11 2014