|
%I #8 Mar 31 2012 12:35:05
%S 1,30,480,6420,99420,1572180,25422222,416454978,6885816564,
%T 114581515836,1915137946090,32108164577926,539443877987058,
%U 9076218410008338,152859785704323702,2576172883673109030
%N Number of base 30 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
|
