|
%I #8 Mar 31 2012 12:35:02
%S 1,12,114,978,9326,90242,879720,8596348,84075398,822546834,8048253694,
%T 78751777578,770593650824,7540371931312,73783784770460,
%U 721987009459748,7064768636705670,69129997621163354,676449147398209026
%N Number of base 12 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
|
