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.

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

This page as a plain text file.
%I A196206 #7 Jun 02 2025 04:18:34
%S A196206 5,11,14,35,70,136,305,611,1321,2832,6041,12936,27706,59515,128053,
%T A196206 275195,591576,1272021,2736374,5887462,12665855,27247361,58620223,
%U A196206 126125420,271372681,583876552,1256241214,2702904009,5815589949
%N A196206 Number of nX4 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,0,3,4,1 for x=0,1,2,3,4.
%C A196206 Every 0 is next to 0 2's, every 1 is next to 1 0's, every 2 is next to 2 3's, every 3 is next to 3 4's, every 4 is next to 4 1's
%C A196206 Column 4 of A196210
%H A196206 R. H. Hardin, <a href="/A196206/b196206.txt">Table of n, a(n) for n = 1..200</a>
%F A196206 Empirical: a(n) = 4*a(n-1) -6*a(n-2) +7*a(n-3) -5*a(n-4) -a(n-5) -a(n-6) -6*a(n-7) +12*a(n-8) -2*a(n-9) +18*a(n-10) -29*a(n-11) +12*a(n-12) -2*a(n-13) -4*a(n-14) +16*a(n-15) -9*a(n-16) +7*a(n-17) -4*a(n-18) -3*a(n-19)
%e A196206 Some solutions for n=5
%e A196206 ..1..1..0..0....1..1..0..1....0..0..0..0....0..1..1..0....0..0..1..1
%e A196206 ..0..1..1..1....0..1..1..1....0..0..0..0....1..1..1..0....1..1..1..0
%e A196206 ..1..1..1..1....1..4..1..0....0..0..0..0....1..0..1..1....1..1..4..1
%e A196206 ..1..0..0..0....1..1..1..0....0..0..0..0....1..1..4..1....0..0..1..1
%e A196206 ..1..0..0..0....0..0..1..1....0..0..0..0....0..1..1..0....1..1..1..0
%K A196206 nonn
%O A196206 1,1
%A A196206 _R. H. Hardin_ Sep 29 2011