login
A125486
Number of base 29 circular n-digit numbers with adjacent digits differing by 9 or less.
0
1, 29, 461, 6149, 94841, 1494029, 24058649, 392382845, 6456869825, 106889962925, 1776707277481, 29612925731429, 494472539606897, 8266744720016461, 138318803993190393, 2315601371476011509
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: A010981 A022593 A078115 * A282925 A022657 A182014
KEYWORD
nonn,base
AUTHOR
R. H. Hardin, Dec 28 2006
STATUS
approved