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.

A241432 Number of nX5 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of elements above it or zero plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4.

This page as a plain text file.
%I A241432 #6 Jun 02 2025 10:08:38
%S A241432 10,45,158,1563,7495,37148,218885,1059975,7257895,44141371,244603126,
%T A241432 1599162188,8958092747,55332407751,336911717484,1937285923500,
%U A241432 12085963190320,70661956336398,424547431732947,2581132242865135
%N A241432 Number of nX5 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of elements above it or zero plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4.
%C A241432 Column 5 of A241435
%H A241432 R. H. Hardin, <a href="/A241432/b241432.txt">Table of n, a(n) for n = 1..32</a>
%e A241432 Some solutions for n=4
%e A241432 ..3..3..2..3..3....2..2..3..3..2....3..2..3..2..2....3..3..2..3..2
%e A241432 ..2..2..2..1..2....2..1..3..2..2....2..1..1..2..0....2..1..2..1..2
%e A241432 ..3..3..0..2..0....3..1..2..0..2....3..3..2..0..0....3..3..2..0..0
%e A241432 ..2..2..2..2..0....2..0..0..0..2....2..0..2..0..0....3..1..2..0..2
%K A241432 nonn
%O A241432 1,1
%A A241432 _R. H. Hardin_, Apr 22 2014