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

A125450
Number of base 15 circular n-digit numbers with adjacent digits differing by 8 or less.
0
1, 15, 183, 2031, 24907, 309275, 3863091, 48336527, 605167019, 7578088593, 94901326543, 1188486366599, 14883984640087, 186399715293651, 2334380328957769, 29234663364972731, 366120980626529371
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: A016158 A335509 A193701 * A193709 A157689 A273654
KEYWORD
nonn,base
AUTHOR
R. H. Hardin, Dec 28 2006
STATUS
approved