The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #8 Mar 31 2012 12:35:02
%S 1,19,251,2899,38027,509239,6922823,94744711,1301066891,17895943729,
%T 246351600811,3392528778229,46727519959343,643666830505159,
%U 8866832290305149,122147626590349999,1682697341501872923
%N Number of base 19 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