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.

A230755 Number of (n+3)X(6+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 A230755 #6 Jul 23 2025 06:00:09
%S A230755 4120752,3423037464,3154520054700,2446111719135732,
%T A230755 1928867953682733132,1504181314566629793432,1173949802576478433728192,
%U A230755 915433809414452667025137888,713802193109443984513638090432
%N A230755 Number of (n+3)X(6+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 A230755 Column 6 of A230757
%H A230755 R. H. Hardin, <a href="/A230755/b230755.txt">Table of n, a(n) for n = 1..189</a>
%e A230755 Some solutions for n=1
%e A230755 ..0..1..0..2..1..0..0..2..0....0..2..0..1..1..2..0..2..0
%e A230755 ..2..1..0..0..1..2..0..1..1....0..1..2..0..1..2..0..1..1
%e A230755 ..0..0..2..2..2..1..1..0..2....0..1..2..0..1..1..2..2..0
%e A230755 ..2..1..1..1..1..1..2..0..2....0..2..2..1..2..0..1..1..1
%K A230755 nonn
%O A230755 1,1
%A A230755 _R. H. Hardin_, Oct 29 2013