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.

A239825 Number of 7Xn 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it, modulo 4.

This page as a plain text file.
%I A239825 #6 Jun 02 2025 09:33:36
%S A239825 293,78188,28156167,9807771898,3347474694032,1154988223050638,
%T A239825 399696014140196630,138146553326582677362,47759100046784529992245,
%U A239825 16518942523671833416785350,5714008803899171208707626059
%N A239825 Number of 7Xn 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it, modulo 4.
%C A239825 Row 7 of A239819
%H A239825 R. H. Hardin, <a href="/A239825/b239825.txt">Table of n, a(n) for n = 1..210</a>
%e A239825 Some solutions for n=2
%e A239825 ..3..0....2..0....3..0....3..2....3..0....2..3....2..0....2..0....3..2....3..2
%e A239825 ..2..0....1..3....1..0....1..0....2..3....1..2....1..3....1..3....2..1....3..0
%e A239825 ..1..3....3..2....2..0....3..1....1..2....3..1....1..3....3..2....3..2....1..2
%e A239825 ..2..1....2..0....1..0....1..3....1..0....2..0....3..2....2..3....2..1....1..2
%e A239825 ..3..0....3..1....3..0....3..2....1..0....2..0....3..0....2..0....2..1....3..0
%e A239825 ..1..2....1..0....1..3....3..2....2..0....2..1....1..2....2..3....2..1....3..0
%e A239825 ..3..2....2..0....2..3....2..0....2..1....2..1....3..0....2..1....2..0....1..2
%K A239825 nonn
%O A239825 1,1
%A A239825 _R. H. Hardin_, Mar 27 2014