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.

A239408 Number of 4Xn 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 A239408 #7 Jun 02 2025 09:28:02
%S A239408 28,698,16449,394509,9340070,222457036,5277728354,125489197292,
%T A239408 2979675864286,70809806218933,1681881988746468,39960823740980549,
%U A239408 949269180927265463,22552572727646416085,535760871479260663596
%N A239408 Number of 4Xn 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 A239408 Row 4 of A239405
%H A239408 R. H. Hardin, <a href="/A239408/b239408.txt">Table of n, a(n) for n = 1..210</a>
%H A239408 R. H. Hardin, <a href="/A239408/a239408.txt">Empirical recurrence of order 91</a>
%F A239408 Empirical recurrence of order 91 (see link above)
%e A239408 Some solutions for n=3
%e A239408 ..0..0..0....0..3..3....0..3..3....3..3..0....3..1..3....0..0..3....3..3..0
%e A239408 ..0..0..0....3..2..3....3..3..2....0..0..0....2..0..2....3..3..0....0..0..0
%e A239408 ..3..1..3....0..0..2....3..1..2....3..2..1....2..0..2....0..3..3....0..0..0
%e A239408 ..3..2..0....2..1..3....2..0..2....2..0..0....3..1..3....0..2..2....0..2..1
%K A239408 nonn
%O A239408 1,1
%A A239408 _R. H. Hardin_, Mar 17 2014