|
| |
|
|
A125401
|
|
Number of base 13 circular n-digit numbers with adjacent digits differing by 6 or less.
|
|
0
| |
|
|
1, 13, 127, 1105, 10795, 107393, 1079611, 10895625, 110142955, 1114176427, 11273835207, 114087679433, 1154585364439, 11684809702241, 118255306926065, 1196798479732385, 12112170879045915, 122581006718527659
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| [Empirical] a(base,n)=a(base-1,n)+F(6) for base>=6.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]`>6)+($[(i+1)mod N]`-$[i]`>6))
|
|
|
CROSSREFS
| Sequence in context: A201086 A139786 A016169 * A089763 A124298 A201040
Adjacent sequences: A125398 A125399 A125400 * A125402 A125403 A125404
|
|
|
KEYWORD
| nonn,base
|
|
|
AUTHOR
| R. H. Hardin (rhhardin(AT)att.net), Dec 28 2006
|
| |
|
|
