|
%I #8 Mar 31 2012 12:35:05
%S 1,32,518,6962,108578,1728482,28149368,464599244,7743848026,
%T 129978213530,2192713621708,37126026014824,630255487661516,
%U 10719498624749596,182565758245973662,3112315935214304042
%N Number of base 32 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
|
