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

A125485
Number of base 28 circular n-digit numbers with adjacent digits differing by 9 or less.
0
1, 28, 442, 5878, 90262, 1415878, 22695076, 368310712, 6028038286, 99207708814, 1638704629522, 27132638036202, 449943629944228, 7468996856620028, 124065300876811890, 2061684054575682598, 34269888230469320798
OFFSET
0,2
COMMENTS
[Empirical] a(base,n)=a(base-1,n)+F(9) for base>=9.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]`>9)+($[(i+1)mod N]`-$[i]`>9))
CROSSREFS
Sequence in context: A121803 A022656 A154588 * A054337 A009685 A007833
KEYWORD
nonn,base
AUTHOR
R. H. Hardin, Dec 28 2006
STATUS
approved