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”).

A125464
Number of base 29 circular n-digit numbers with adjacent digits differing by 8 or less.
0
1, 29, 421, 5069, 70837, 1010249, 14740909, 217995737, 3255957037, 48976631435, 740533885451, 11239159868317, 171044330389201, 2608208803392351, 39828729299757791, 608832410638733369, 9313671013658414813
OFFSET
0,2
COMMENTS
[Empirical] a(base,n)=a(base-1,n)+F(8) for base>=8.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]`>8)+($[(i+1)mod N]`-$[i]`>8))
CROSSREFS
Sequence in context: A264160 A210302 A163021 * A161572 A161972 A162376
KEYWORD
nonn,base
AUTHOR
R. H. Hardin, Dec 28 2006
STATUS
approved