login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A125417
Number of base 29 circular n-digit numbers with adjacent digits differing by 6 or less.
0
1, 29, 335, 3137, 34299, 381809, 4352375, 50303933, 587692819, 6921768047, 82044792805, 977439559037, 11692570914903, 140339755157709, 1689036837196127, 20373841082411507, 246211831840225443
OFFSET
0,2
COMMENTS
[Empirical] a(base,n)=a(base-1,n)+F(6) for base>=6.int(n/2)+1 and F(d) is the largest coefficient in (1+x+...+x^(2d))^n
PROG
(S/R) stvar $[N]:(0..M-1) init $[]:=0 asgn $[]->{*} kill +[i in 0..N-1](($[i]`-$[(i+1)mod N]`>6)+($[(i+1)mod N]`-$[i]`>6))
CROSSREFS
Sequence in context: A107966 A057131 A160442 * A156640 A239743 A022689
KEYWORD
nonn,base
AUTHOR
R. H. Hardin, Dec 28 2006
STATUS
approved