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.

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

This page as a plain text file.
%I A239411 #6 May 27 2021 13:52:08
%S A239411 368,113774,32507376,9402398952,2671846338458,765206237815409,
%T A239411 217822754771248124,62224253930396430225,17732860047914475927901,
%U A239411 5061141668045083629968143,1443095146623473513048203207
%N A239411 Number of 7 X n 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of the elements above it, modulo 4.
%C A239411 Row 7 of A239405.
%H A239411 R. H. Hardin, <a href="/A239411/b239411.txt">Table of n, a(n) for n = 1..210</a>
%e A239411 Some solutions for n=2
%e A239411 ..0..3....3..3....3..3....0..3....0..3....0..3....3..3....0..3....0..3....3..1
%e A239411 ..0..3....0..2....2..2....3..2....0..2....0..2....0..2....0..3....3..2....0..2
%e A239411 ..3..1....0..0....2..0....0..0....3..2....3..2....3..1....3..1....2..0....0..0
%e A239411 ..3..3....0..0....2..0....2..2....2..2....0..2....2..1....0..3....0..2....3..2
%e A239411 ..3..3....0..0....2..1....0..0....0..0....3..2....0..0....2..1....2..2....3..1
%e A239411 ..0..2....0..0....0..3....0..3....2..1....3..3....3..3....0..2....2..1....0..2
%e A239411 ..0..2....2..2....3..1....0..3....3..3....0..3....3..2....2..2....0..3....2..1
%Y A239411 Cf. A239405.
%K A239411 nonn
%O A239411 1,1
%A A239411 _R. H. Hardin_, Mar 17 2014