login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A124799 Number of base 30 circular n-digit numbers with adjacent digits differing by 1 or less. 1
1, 30, 88, 204, 548, 1460, 4006, 11090, 31036, 87468, 248018, 706670, 2021738, 5804010, 16711552, 48241364, 139572076, 404612780, 1175026834, 3417771710, 9955368238, 29035695998, 84784671532, 247838482400, 725183659570 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

[Empirical] a(base,n)=a(base-1,n)+A002426(n+1) for base>=1.int(n/2)+1

a(n) = T(n, 30) 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,..,30}. See theorem 3.3 in Knopfmacher and others, reference in A124696. - Peter Luschny, Aug 13 2012

LINKS

Table of n, a(n) for n=0..24.

PROG

(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))

CROSSREFS

Sequence in context: A058903 A254474 A103906 * A126384 A025417 A081807

Adjacent sequences:  A124796 A124797 A124798 * A124800 A124801 A124802

KEYWORD

nonn,base

AUTHOR

R. H. Hardin, Dec 28 2006

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 17 02:26 EDT 2021. Contains 343059 sequences. (Running on oeis4.)