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.

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

This page as a plain text file.
%I A196433 #7 Jun 02 2025 04:24:00
%S A196433 6,41,213,1283,7358,42604,246463,1427278,8257394,47782109,276548288,
%T A196433 1600318316,9261110693,53594650946,310152403800,1794861048704,
%U A196433 10386914552975,60109320907593,347854219621911,2013041621414557
%N A196433 Number of nX5 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,1,0,3,4 for x=0,1,2,3,4.
%C A196433 Every 0 is next to 0 2's, every 1 is next to 1 1's, every 2 is next to 2 0's, every 3 is next to 3 3's, every 4 is next to 4 4's
%C A196433 Column 5 of A196436
%H A196433 R. H. Hardin, <a href="/A196433/b196433.txt">Table of n, a(n) for n = 1..200</a>
%F A196433 Empirical: a(n) = 2*a(n-1) +10*a(n-2) +53*a(n-3) +82*a(n-4) +111*a(n-5) -129*a(n-6) -827*a(n-7) -1254*a(n-8) +2309*a(n-9) +2065*a(n-10) -3149*a(n-11) -3500*a(n-12) +4105*a(n-13) +5856*a(n-14) -8008*a(n-15) +1008*a(n-16) +5189*a(n-17) -1830*a(n-18) -2683*a(n-19) +2403*a(n-20) +8398*a(n-21) -10099*a(n-22) +2582*a(n-23) -6932*a(n-24) +4579*a(n-25) -1024*a(n-26) +641*a(n-27) -588*a(n-28) +234*a(n-29) -402*a(n-30) +159*a(n-31) -79*a(n-32) +60*a(n-33) -5*a(n-34) +3*a(n-35) -a(n-36)
%e A196433 Some solutions for n=4
%e A196433 ..0..0..1..1..0....1..1..0..0..0....1..1..0..1..0....0..0..0..1..1
%e A196433 ..1..0..0..0..0....0..0..0..1..0....0..0..0..1..0....0..1..1..0..0
%e A196433 ..1..0..0..1..1....0..0..0..1..0....1..1..0..0..1....0..0..0..0..0
%e A196433 ..0..0..0..0..0....1..1..0..0..0....0..0..0..0..1....1..1..0..1..1
%K A196433 nonn
%O A196433 1,1
%A A196433 _R. H. Hardin_ Oct 02 2011