%I #8 Mar 31 2012 12:35:02
%S 1,29,461,6149,94841,1494029,24058649,392382845,6456869825,
%T 106889962925,1776707277481,29612925731429,494472539606897,
%U 8266744720016461,138318803993190393,2315601371476011509
%N Number of base 29 circular n-digit numbers with adjacent digits differing by 9 or less.
%C [Empirical] a(base,n)=a(base-1,n)+F(9) for base>=9.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]`>9)+($[(i+1)mod N]`-$[i]`>9))
%K nonn,base
%O 0,2
%A _R. H. Hardin_, Dec 28 2006
|