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.

A125545 Number of n X n arrays with entries in 1..11 in which adjacent entries differ by 8 or less (adjacent means in x or y directions).

This page as a plain text file.
%I A125545 #6 Mar 31 2012 12:35:05
%S A125545 1,11,12199,1419562557,17124710891367659,21446024690051517579350807,
%T A125545 2787767647614213119983106320870299629,
%U A125545 37614839219636718408474282959362229237375107365087
%N A125545 Number of n X n arrays with entries in 1..11 in which adjacent entries differ by 8 or less (adjacent means in x or y directions).
%C A125545 [Empirical] a(base+1,n,diff)=a(base,n,diff)+F(n,diff) for base>=2.diff.(n-1) and F(n,diff)= (n=2, A063496(diff+1)) (n=3, A068744(diff+1)) (n=4, A068745(diff+1)) (n=5, A068746(diff+1)) (n=6, A068747(diff+1))
%o A125545 (S/R) stvar $[N][N]:(0.. M-1) init $[][]:=0 asgn $[][]->{*} kill +[i in 0.. N-2](+[j in 0.. N-1](($[i][j]`-$[i+1][j]`>8)+($[i+1][j]`-$[i][j]`>8)+($[j][i]`-$[j][i+1]`>8)+($[j][i+1]`-$[j][i]`>8)))
%K A125545 nonn
%O A125545 0,2
%A A125545 _R. H. Hardin_, Dec 31 2006