|
Search: id:A125487
|
|
|
| A125487 |
|
Number of base 30 circular n-digit numbers with adjacent digits differing by 9 or less. |
|
+0
1
|
|
| 1, 30, 480, 6420, 99420, 1572180, 25422222, 416454978, 6885816564, 114581515836, 1915137946090, 32108164577926, 539443877987058, 9076218410008338, 152859785704323702, 2576172883673109030
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
[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
|
|
PROGRAM
|
(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
|
Adjacent sequences: A125484 A125485 A125486 this_sequence A125488 A125489 A125490
Sequence in context: A010982 A022594 A004416 this_sequence A072976 A127544 A133927
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Ron Hardin (rhh(AT)cadence.com), Dec 28 2006
|
|
|
Search completed in 0.002 seconds
|
