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.

A232292 Number of nX5 0..2 arrays with every 0 next to a 1 and every 1 next to a 2 horizontally or antidiagonally.

This page as a plain text file.
%I A232292 #6 Jul 23 2025 07:15:48
%S A232292 33,3615,336079,31119789,2885285507,267483142619,24797475083765,
%T A232292 2298890419506403,213122398219612007,19757860629284815473,
%U A232292 1831684796948684817831,169809336055727719993459
%N A232292 Number of nX5 0..2 arrays with every 0 next to a 1 and every 1 next to a 2 horizontally or antidiagonally.
%C A232292 Column 5 of A232295
%H A232292 R. H. Hardin, <a href="/A232292/b232292.txt">Table of n, a(n) for n = 1..210</a>
%F A232292 Empirical: a(n) = 77*a(n-1) +1414*a(n-2) +4190*a(n-3) -25759*a(n-4) -74189*a(n-5) +246122*a(n-6) -20486*a(n-7) -1442713*a(n-8) +3110141*a(n-9) -347652*a(n-10) -624656*a(n-11) +210492*a(n-12) -18900*a(n-13) for n>14
%e A232292 Some solutions for n=2
%e A232292 ..2..2..2..1..2....2..0..1..2..1....2..1..1..2..2....1..2..2..1..0
%e A232292 ..2..2..2..2..2....2..0..2..2..1....2..2..0..1..0....2..2..2..1..0
%K A232292 nonn
%O A232292 1,1
%A A232292 _R. H. Hardin_, Nov 22 2013