%I #8 Mar 31 2012 12:35:02
%S 1,13,149,1597,18421,213703,2485463,28921087,336574029,3917060635,
%T 45587258159,530551444117,6174641413639,71861459611123,
%U 836335130323205,9733401730942177,113278883062209261,1318357724085097789
%N Number of base 13 circular n-digit numbers with adjacent digits differing by 8 or less.
%C [Empirical] a(base,n)=a(base-1,n)+F(8) for base>=8.int(n/2)+1 and F(d) is the largest coefficient in (1+x+...+x^(2d))^n
%o (S/R) stvar $[N]:(0..M-1) init $[]:=0 asgn $[]->{*} kill +[i in 0..N-1](($[i]`-$[(i+1)mod N]`>8)+($[(i+1)mod N]`-$[i]`>8))
%K nonn,base
%O 0,2
%A _R. H. Hardin_, Dec 28 2006
|