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.

A238282 Number of (n+1)X(2+1) 0..3 arrays with no element greater than all horizontal neighbors or less than all vertical neighbors.

This page as a plain text file.
%I A238282 #7 Jul 23 2025 10:49:43
%S A238282 16,204,1844,13948,105862,850420,6953993,56279542,451637564,
%T A238282 3624058880,29149448933,234656231134,1888292962943,15189590878387,
%U A238282 122183775722351,982931386549726,7907698617955660,63616689428833346,511782089100478490
%N A238282 Number of (n+1)X(2+1) 0..3 arrays with no element greater than all horizontal neighbors or less than all vertical neighbors.
%C A238282 Column 2 of A238287
%H A238282 R. H. Hardin, <a href="/A238282/b238282.txt">Table of n, a(n) for n = 1..210</a>
%F A238282 Empirical: a(n) = 10*a(n-1) -39*a(n-2) +185*a(n-3) -107*a(n-4) +907*a(n-5) +577*a(n-6) +1691*a(n-7) -223*a(n-8) -2043*a(n-9) -4899*a(n-10) -7123*a(n-11) -255*a(n-12) +10972*a(n-13) +9211*a(n-14) -2698*a(n-15) -7428*a(n-16) -2381*a(n-17) +1946*a(n-18) +1556*a(n-19) +67*a(n-20) -283*a(n-21) -88*a(n-22) +9*a(n-23) +8*a(n-24) +a(n-25)
%e A238282 Some solutions for n=5
%e A238282 ..3..3..0....3..3..2....1..1..1....1..1..0....2..2..0....3..3..1....3..3..3
%e A238282 ..1..1..0....2..2..2....1..1..1....1..1..0....0..0..0....3..3..1....1..2..2
%e A238282 ..0..1..1....1..1..0....1..1..0....3..3..0....0..0..0....2..2..1....1..2..2
%e A238282 ..0..3..3....0..0..0....1..1..0....2..2..0....0..3..3....1..1..0....2..2..1
%e A238282 ..2..2..1....0..0..0....3..3..0....2..2..0....0..1..1....1..1..0....2..2..1
%e A238282 ..2..2..1....2..2..0....3..3..2....2..2..2....0..1..1....3..3..2....2..2..1
%K A238282 nonn
%O A238282 1,1
%A A238282 _R. H. Hardin_, Feb 22 2014