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.

A222461 Number of nX5 0..7 arrays with no entry increasing mod 8 by 7 rightwards or downwards, starting with upper left zero.

This page as a plain text file.
%I A222461 #6 Jul 23 2025 02:37:01
%S A222461 2401,23931607,238535974201,2377584520856755,23698346512668445387,
%T A222461 236211004301185098853381,2354410613553773007691517269,
%U A222461 23467362808156794232691794722151,233908696299327013910964536639599807
%N A222461 Number of nX5 0..7 arrays with no entry increasing mod 8 by 7 rightwards or downwards, starting with upper left zero.
%C A222461 Column 5 of A222462
%H A222461 R. H. Hardin, <a href="/A222461/b222461.txt">Table of n, a(n) for n = 1..32</a>
%F A222461 Empirical: a(n) = 10754*a(n-1) -8060499*a(n-2) +2219242223*a(n-3) -245682627864*a(n-4) +5798947687589*a(n-5) +448113231493438*a(n-6) -2763020698450992*a(n-7)
%e A222461 Some solutions for n=3
%e A222461 ..0..0..4..4..1....0..0..0..1..2....0..0..4..0..1....0..0..0..3..4
%e A222461 ..0..0..0..4..5....0..0..0..1..4....0..0..0..4..7....0..0..0..3..1
%e A222461 ..0..0..0..2..2....0..0..0..1..5....0..0..0..1..2....0..0..0..1..2
%K A222461 nonn
%O A222461 1,1
%A A222461 _R. H. Hardin_ Feb 21 2013