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.

A239157 Number of (4+1)X(n+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 A239157 #6 Jul 23 2025 10:58:00
%S A239157 17,208,5775,135766,3313304,80240064,1946535209,47203774762,
%T A239157 1144788832875,27763021735024,673301630092412,16328724383102508,
%U A239157 395999761775761841,9603677662310968264,232905759724044440751
%N A239157 Number of (4+1)X(n+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 A239157 Row 4 of A239155
%H A239157 R. H. Hardin, <a href="/A239157/b239157.txt">Table of n, a(n) for n = 1..210</a>
%F A239157 Empirical: a(n) = 20*a(n-1) +125*a(n-2) -466*a(n-3) -1721*a(n-4) +3476*a(n-5) +3342*a(n-6) -3082*a(n-7) -5349*a(n-8) -4488*a(n-9) +8976*a(n-10) +2826*a(n-11) -2862*a(n-12) -324*a(n-13) +243*a(n-14)
%e A239157 Some solutions for n=4
%e A239157 ..0..1..1..2..3....0..1..2..0..3....0..1..0..0..1....0..1..0..2..0
%e A239157 ..0..1..1..2..3....0..1..2..0..3....0..1..0..0..1....0..1..0..2..0
%e A239157 ..0..1..0..1..3....0..1..0..0..3....0..1..0..0..1....0..1..0..1..3
%e A239157 ..0..2..0..1..3....2..0..0..2..3....1..2..0..3..0....3..0..3..1..3
%e A239157 ..0..2..0..1..3....2..0..0..2..3....1..2..0..3..0....3..0..3..1..3
%K A239157 nonn
%O A239157 1,1
%A A239157 _R. H. Hardin_, Mar 11 2014