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.

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

This page as a plain text file.
%I A196489 #7 Jun 02 2025 04:26:01
%S A196489 1,5,23,99,435,1821,7761,33445,142899,610111,2610127,11166323,
%T A196489 47747117,204171367,873175939,3734216551,15969151905,68291795495,
%U A196489 292051077171,1248957218645,5341159082973,22841464889713,97681553556621
%N A196489 Number of nX4 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,3,0,1,4 for x=0,1,2,3,4.
%C A196489 Every 0 is next to 0 2's, every 1 is next to 1 3's, every 2 is next to 2 0's, every 3 is next to 3 1's, every 4 is next to 4 4's
%C A196489 Column 4 of A196493
%H A196489 R. H. Hardin, <a href="/A196489/b196489.txt">Table of n, a(n) for n = 1..200</a>
%F A196489 Empirical: a(n) = a(n-1) +5*a(n-2) +25*a(n-3) +48*a(n-4) +51*a(n-5) -25*a(n-6) -59*a(n-7) +13*a(n-8) +77*a(n-9) +36*a(n-10) -11*a(n-11) -31*a(n-12) -17*a(n-13) -2*a(n-14) +3*a(n-15) +a(n-16)
%e A196489 Some solutions for n=5
%e A196489 ..0..0..0..0....1..3..1..1....0..0..0..0....0..0..0..0....1..0..0..0
%e A196489 ..0..0..0..1....0..1..1..3....1..3..1..0....1..3..1..1....3..1..1..0
%e A196489 ..1..0..1..3....0..1..0..1....0..1..0..0....1..1..1..3....1..1..3..1
%e A196489 ..3..1..1..1....0..3..1..0....0..1..0..0....3..1..1..1....0..1..0..0
%e A196489 ..1..1..3..1....0..1..0..0....1..3..1..0....1..1..3..1....1..3..1..0
%K A196489 nonn
%O A196489 1,2
%A A196489 _R. H. Hardin_ Oct 03 2011