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.

A230754 Number of (n+3)X(5+3) 0..2 arrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.

This page as a plain text file.
%I A230754 #6 Jul 23 2025 06:00:02
%S A230754 363312,129731328,51048476748,17027460691212,5769362600920812,
%T A230754 1928867953682733132,645610139671314494208,215988462456574388976300,
%U A230754 72238352925469656400705200,24160858241776435434419641008
%N A230754 Number of (n+3)X(5+3) 0..2 arrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.
%C A230754 Column 5 of A230757
%H A230754 R. H. Hardin, <a href="/A230754/b230754.txt">Table of n, a(n) for n = 1..200</a>
%e A230754 Some solutions for n=1
%e A230754 ..0..1..0..0..1..0..0..0....0..0..0..0..2..1..0..0....0..2..0..2..1..0..0..0
%e A230754 ..0..1..2..2..1..0..1..1....2..1..1..2..2..0..1..1....1..1..0..0..0..2..1..1
%e A230754 ..2..2..1..1..2..2..2..0....2..2..1..1..1..1..2..2....0..0..2..1..1..2..2..0
%e A230754 ..1..0..1..0..0..1..2..1....1..0..0..0..0..1..0..1....2..1..2..0..1..0..1..1
%K A230754 nonn
%O A230754 1,1
%A A230754 _R. H. Hardin_, Oct 29 2013