|
| |
|
|
A125476
|
|
Number of base 19 circular n-digit numbers with adjacent digits differing by 9 or less.
|
|
0
| |
|
|
1, 19, 271, 3439, 49051, 712519, 10458163, 154101799, 2274460507, 33592425049, 496277475271, 7332583525319, 108345196911631, 1600923503226079, 23655650115244789, 349542980141854759, 5164958667871471243
(list; graph; refs; listen; history; internal format)
|
|
|
|
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: A083004 A139739 A016189 * A016248 A199819 A016187
Adjacent sequences: A125473 A125474 A125475 * A125477 A125478 A125479
|
|
|
KEYWORD
| nonn,base
|
|
|
AUTHOR
| R. H. Hardin (rhhardin(AT)att.net), Dec 28 2006
|
| |
|
|
