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

A125467
Number of base 32 circular n-digit numbers with adjacent digits differing by 8 or less.
0
1, 32, 472, 5720, 80680, 1160552, 17087368, 255059144, 3847010920, 58470091304, 893868096012, 13725977829244, 211491017541784, 3267183192531056, 50573396314085242, 784031120369340530, 12168860465362831864
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: A010837 A022724 A284339 * A282525 A250319 A000152
KEYWORD
nonn,base
AUTHOR
R. H. Hardin, Dec 28 2006
STATUS
approved