The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A124804 Number of base 32 circular n-digit numbers with adjacent digits differing by 1 or less. 1
 1, 32, 94, 218, 586, 1562, 4288, 11876, 33250, 93746, 265924, 757976, 2169316, 6229892, 17944006, 51816578, 149965330, 434882642, 1263332452, 3675765416, 10710126976, 31246397456, 91266942586, 266864938646, 781080332332 (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, 32) 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,..,32}. 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: A220581 A297730 A360436 * A188184 A126386 A208635 Adjacent sequences: A124801 A124802 A124803 * A124805 A124806 A124807 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 2 13:23 EST 2023. Contains 367524 sequences. (Running on oeis4.)