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.

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

This page as a plain text file.
%I A196311 #7 Jun 02 2025 04:21:05
%S A196311 8,34,111,866,3349,21545,132202,626170,3119098,18588893,109247680,
%T A196311 581746205,3045137702,17018115620,96581654323,529545856166,
%U A196311 2858809327649,15727308156830,87667270415711,483842000666953,2645294630253350
%N A196311 Number of nX5 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,0,4,1,3 for x=0,1,2,3,4.
%C A196311 Every 0 is next to 0 2's, every 1 is next to 1 0's, every 2 is next to 2 4's, every 3 is next to 3 1's, every 4 is next to 4 3's
%C A196311 Column 5 of A196314
%H A196311 R. H. Hardin, <a href="/A196311/b196311.txt">Table of n, a(n) for n = 1..200</a>
%e A196311 Some solutions for n=4
%e A196311 ..1..1..3..1..0....0..0..0..1..1....0..0..0..0..0....1..1..3..1..0
%e A196311 ..0..0..1..1..0....1..3..1..3..0....1..1..3..1..1....0..0..1..3..1
%e A196311 ..0..0..3..1..0....3..1..1..1..1....3..1..1..1..1....0..0..1..3..1
%e A196311 ..0..0..1..3..1....1..0..0..0..1....1..0..0..0..0....0..0..1..1..0
%K A196311 nonn
%O A196311 1,1
%A A196311 _R. H. Hardin_ Oct 01 2011