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.

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

This page as a plain text file.
%I A197470 #7 Jun 02 2025 04:56:35
%S A197470 3,6,26,46,181,374,1300,2886,9446,22060,69096,167466,507600,1265434,
%T A197470 3741192,9529514,27644128,71580304,204668940,536641128,1517618972,
%U A197470 4017418484,11266355518,30042504088,83713614532,224474050480
%N A197470 Number of nX3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 0,1,0,0,0 for x=0,1,2,3,4.
%C A197470 Every 0 is next to 0 0's, every 1 is next to 1 1's, every 2 is next to 2 0's, every 3 is next to 3 0's, every 4 is next to 4 0's
%C A197470 Column 3 of A197475
%H A197470 R. H. Hardin, <a href="/A197470/b197470.txt">Table of n, a(n) for n = 1..200</a>
%F A197470 Empirical: a(n) = 6*a(n-2) +3*a(n-3) +4*a(n-4) -2*a(n-5) +2*a(n-6) -7*a(n-7) -19*a(n-8) -23*a(n-9) -19*a(n-10) -19*a(n-11) -4*a(n-12) -4*a(n-13) for n>16
%e A197470 Some solutions containing all values 0 to 4 for n=4
%e A197470 ..0..1..1....2..0..2....1..2..0....2..0..2....2..0..2....2..0..2....1..1..0
%e A197470 ..3..0..2....0..4..0....1..0..3....0..4..0....0..4..0....0..4..0....2..0..3
%e A197470 ..0..4..0....1..0..3....0..4..0....2..0..3....3..0..2....3..0..1....0..4..0
%e A197470 ..2..0..2....1..2..0....2..0..2....1..1..0....0..1..1....0..2..1....2..0..2
%K A197470 nonn
%O A197470 1,1
%A A197470 _R. H. Hardin_ Oct 15 2011