|
%I #10 Aug 13 2012 11:19:13
%S 1,29,85,197,529,1409,3865,10697,29929,84329,239065,681017,1947949,
%T 5591069,16095325,46453757,134375449,389477849,1130874025,3288774857,
%U 9577988869,27930345269,81543536005,238325254277,697235323189
%N Number of base 29 circular n-digit numbers with adjacent digits differing by 1 or less.
%C [Empirical] a(base,n)=a(base-1,n)+A002426(n+1) for base>=1.int(n/2)+1
%C a(n) = T(n, 29) where T(n, k) = Sum_{j=1..k} (1+2*cos(j*Pi/(k+1)))^n. These are the number of smooth cyclic words of length n over the alphabet {1,2,..,29}. See theorem 3.3 in Knopfmacher and others, reference in A124696. - _Peter Luschny_, Aug 13 2012
%o (S/R) stvar $[N]:(0..M-1) init $[]:=0 asgn $[]->{*} kill +[i in 0..N-1](($[i]`-$[(i+1)mod N]`>1)+($[(i+1)mod N]`-$[i]`>1))
%K nonn,base
%O 0,2
%A _R. H. Hardin_, Dec 28 2006
|
