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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A125343 Number of base 6 circular n-digit numbers with adjacent digits differing by 4 or less. 0
 1, 6, 34, 186, 1058, 6026, 34354, 195866, 1116738, 6367146, 36302674, 206981946, 1180120418, 6728529866, 38363130994, 218729774426, 1247101396098, 7110426078186, 40540535975314, 231144384189306, 1317884064847778 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS [Empirical] a(base,n)=a(base-1,n)+A025014(n+1) for base>=4.int(n/2)+1 LINKS FORMULA Conjectures from Colin Barker, Jun 02 2017: (Start) G.f.: (1 - x^2 - 8*x^3) / ((1 - x)*(1 - 5*x - 4*x^2)). a(n) = 1 + ((5-sqrt(41))/2)^n + ((5+sqrt(41))/2)^n for n>0. a(n) = 6*a(n-1) - a(n-2) - 4*a(n-3) for n>3. (End) PROG (S/R) stvar \$[N]:(0..M-1) init \$[]:=0 asgn \$[]->{*} kill +[i in 0..N-1]((\$[i]`-\$[(i+1)mod N]`>4)+(\$[(i+1)mod N]`-\$[i]`>4)) CROSSREFS Sequence in context: A327740 A229009 A085351 * A163350 A320746 A320749 Adjacent sequences: A125340 A125341 A125342 * A125344 A125345 A125346 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 November 26 18:21 EST 2022. Contains 358362 sequences. (Running on oeis4.)