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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A124708 Number of base 15 circular n-digit numbers with adjacent digits differing by 1 or less. 0
 1, 15, 43, 99, 263, 695, 1891, 5195, 14431, 40383, 113723, 321875, 914903, 2609895, 7468147, 21427259, 61622671, 177588815, 512734699, 1482818915, 4294677703, 12455435063, 36167638627, 105140060555, 305958613855, 891185076095 (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, 15) 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,..,15}. See theorem 3.3 in Knopfmacher and others, reference in A124696. - Peter Luschny, Aug 13 2012 LINKS 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: A069127 A137183 A173873 * A204734 A126369 A193647 Adjacent sequences: A124705 A124706 A124707 * A124709 A124710 A124711 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 March 25 07:22 EDT 2023. Contains 361511 sequences. (Running on oeis4.)