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.

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

This page as a plain text file.
%I A240759 #6 Jun 02 2025 09:59:26
%S A240759 57,124,553,1750,5325,21859,66809,222091,811643,2448916,9024626,
%T A240759 30179690,99789149,353161702,1157895846,3982409016,13642548710,
%U A240759 45571813573,157078910184,529972106693,1796868367572,6142685239467,20734748809544
%N A240759 Number of nX5 0..3 arrays with no element equal to one plus the sum of elements to its left or zero plus the sum of elements above it or zero plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.
%C A240759 Column 5 of A240760
%H A240759 R. H. Hardin, <a href="/A240759/b240759.txt">Table of n, a(n) for n = 1..40</a>
%e A240759 Some solutions for n=4
%e A240759 ..3..1..2..2..2....2..2..3..1..3....2..1..1..3..1....2..2..2..1..2
%e A240759 ..2..0..0..1..1....3..1..0..2..2....3..3..0..2..2....3..1..0..0..3
%e A240759 ..3..3..0..0..1....3..2..0..0..3....2..2..2..0..1....2..2..0..0..3
%e A240759 ..2..1..3..2..3....2..0..0..1..3....2..0..0..2..2....2..0..0..2..3
%K A240759 nonn
%O A240759 1,1
%A A240759 _R. H. Hardin_, Apr 12 2014