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.

A230753 Number of (n+3)X(4+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 A230753 #6 Jul 23 2025 05:59:55
%S A230753 31212,4838400,820317888,116879941620,17027460691212,2446111719135732,
%T A230753 350956390609736652,50358119242966513344,7223117962392705998700,
%U A230753 1035950069921732837599728,148583744714836638940179888
%N A230753 Number of (n+3)X(4+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 A230753 Column 4 of A230757
%H A230753 R. H. Hardin, <a href="/A230753/b230753.txt">Table of n, a(n) for n = 1..200</a>
%e A230753 Some solutions for n=1
%e A230753 ..0..1..2..0..1..0..1....0..0..1..2..1..1..2....0..1..2..0..2..0..2
%e A230753 ..2..1..0..0..1..2..2....2..1..1..2..0..0..2....0..1..2..0..1..0..2
%e A230753 ..0..0..2..2..0..0..1....2..1..1..2..0..0..2....0..1..0..2..1..0..2
%e A230753 ..2..2..1..1..2..2..2....0..0..1..2..1..1..2....0..2..0..2..2..1..2
%K A230753 nonn
%O A230753 1,1
%A A230753 _R. H. Hardin_, Oct 29 2013