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.

A239402 Number of nX5 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 A239402 #6 Jun 02 2025 09:27:27
%S A239402 32,2165,144762,9340070,614216271,40566958960,2671846338458,
%T A239402 176044655676921,11610439554314901,765805659265654829,
%U A239402 50509810922229600429,3331665731491459450247,219768507035072764751942
%N A239402 Number of nX5 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 A239402 Column 5 of A239405
%H A239402 R. H. Hardin, <a href="/A239402/b239402.txt">Table of n, a(n) for n = 1..210</a>
%e A239402 Some solutions for n=2
%e A239402 ..0..3..3..0..0....3..1..0..3..1....3..3..1..3..0....0..0..0..3..1
%e A239402 ..3..2..0..1..1....2..1..3..0..0....3..3..1..3..0....3..1..0..0..0
%K A239402 nonn
%O A239402 1,1
%A A239402 _R. H. Hardin_, Mar 17 2014