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.

A196805 Number of nX4 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 4,2,3,0,1 for x=0,1,2,3,4.

This page as a plain text file.
%I A196805 #7 Jun 02 2025 04:34:24
%S A196805 1,7,37,193,1515,8719,52291,334317,2067173,12663609,78727511,
%T A196805 488078559,3014804713,18665197193,115593457951,715253390987,
%U A196805 4426801402571,27403189146691,169608418907807,1049766166947791,6497692031157569
%N A196805 Number of nX4 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 4,2,3,0,1 for x=0,1,2,3,4.
%C A196805 Every 0 is next to 0 4's, every 1 is next to 1 2's, every 2 is next to 2 3's, every 3 is next to 3 0's, every 4 is next to 4 1's
%C A196805 Column 4 of A196809
%H A196805 R. H. Hardin, <a href="/A196805/b196805.txt">Table of n, a(n) for n = 1..210</a>
%F A196805 Empirical: a(n) = 2*a(n-1) +9*a(n-2) +82*a(n-3) +137*a(n-4) +25*a(n-5) -6*a(n-6) +79*a(n-7) -153*a(n-8) -112*a(n-9) +76*a(n-10) -160*a(n-11) +136*a(n-12) -24*a(n-13)
%e A196805 Some solutions for n=5
%e A196805 ..0..0..3..0....0..0..3..0....0..0..0..0....0..3..0..0....0..0..0..0
%e A196805 ..0..3..0..3....0..0..0..0....0..1..0..0....0..0..3..0....3..0..0..0
%e A196805 ..0..2..0..0....0..0..0..3....1..2..3..0....0..3..2..0....0..3..3..0
%e A196805 ..0..3..0..0....3..0..0..0....0..3..0..3....0..0..0..3....3..0..0..3
%e A196805 ..0..0..0..0....0..3..0..0....0..0..0..0....0..0..0..0....0..0..3..0
%K A196805 nonn
%O A196805 1,2
%A A196805 _R. H. Hardin_ Oct 06 2011