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.

A239400 Number of nX3 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of elements above it, modulo 4.

This page as a plain text file.
%I A239400 #7 Jun 02 2025 09:27:13
%S A239400 8,105,1337,16449,205969,2590704,32507376,408000104,5124790809,
%T A239400 64375497505,808627026775,10157673828398,127600254367522,
%U A239400 1602912146570029,20135780318743491,252946235316308314
%N A239400 Number of nX3 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of elements above it, modulo 4.
%C A239400 Column 3 of A239405
%H A239400 R. H. Hardin, <a href="/A239400/b239400.txt">Table of n, a(n) for n = 1..210</a>
%H A239400 R. H. Hardin, <a href="/A239400/a239400.txt">Empirical recurrence of order 64</a>
%F A239400 Empirical recurrence of order 64 (see link above)
%e A239400 Some solutions for n=5
%e A239400 ..3..1..0....0..0..3....0..0..0....0..0..0....0..3..1....0..0..3....0..3..3
%e A239400 ..3..2..0....0..0..0....0..3..1....3..3..0....3..2..1....3..1..2....3..2..3
%e A239400 ..3..2..3....3..3..2....0..0..0....2..0..0....2..2..3....2..2..2....2..0..1
%e A239400 ..2..2..0....2..2..0....0..3..2....0..0..3....2..2..2....2..2..3....2..2..0
%e A239400 ..3..3..2....0..2..0....3..3..0....2..0..0....0..0..0....0..0..2....0..2..2
%K A239400 nonn
%O A239400 1,1
%A A239400 _R. H. Hardin_, Mar 17 2014