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

A125483
Number of base 26 circular n-digit numbers with adjacent digits differing by 9 or less.
0
1, 26, 404, 5336, 81104, 1259576, 19967936, 320169512, 5171292032, 83900196944, 1364972167264, 22244133830384, 362871115920320, 5923247233768800, 96723397586353984, 1579802606359113536, 25806819552006704128
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: A232334 A020924 A022750 * A229025 A357889 A197087
KEYWORD
nonn,base
AUTHOR
R. H. Hardin, Dec 28 2006
STATUS
approved