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.

A239822 Number of 4Xn 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 A239822 #6 Jul 23 2025 11:00:58
%S A239822 25,582,17552,510748,14544801,418324402,12059066460,347095468871,
%T A239822 9991360194005,287711413471266,8284928413145004,238566125657445992,
%U A239822 6869701227384114007,197820645386511819554,5696463550662058123697
%N A239822 Number of 4Xn 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 A239822 Row 4 of A239819
%H A239822 R. H. Hardin, <a href="/A239822/b239822.txt">Table of n, a(n) for n = 1..210</a>
%e A239822 Some solutions for n=3
%e A239822 ..2..3..2....2..3..0....2..3..2....2..3..0....3..2..3....2..3..3....3..2..0
%e A239822 ..2..3..0....1..2..2....1..3..2....1..2..0....1..2..1....1..2..1....3..0..2
%e A239822 ..3..0..1....2..0..0....3..1..2....1..3..3....3..2..2....1..3..3....1..0..0
%e A239822 ..2..1..2....3..1..2....1..2..2....2..3..2....3..2..0....2..0..3....3..1..2
%K A239822 nonn
%O A239822 1,1
%A A239822 _R. H. Hardin_, Mar 27 2014