%I #8 Mar 31 2012 12:35:02
%S 1,29,335,3137,34299,381809,4352375,50303933,587692819,6921768047,
%T 82044792805,977439559037,11692570914903,140339755157709,
%U 1689036837196127,20373841082411507,246211831840225443
%N Number of base 29 circular n-digit numbers with adjacent digits differing by 6 or less.
%C [Empirical] a(base,n)=a(base-1,n)+F(6) for base>=6.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]`>6)+($[(i+1)mod N]`-$[i]`>6))
%K nonn,base
%O 0,2
%A _R. H. Hardin_, Dec 28 2006