|
Search: id:A100601
|
|
|
| A100601 |
|
Denominator of the best rational approximation to the decimal representation of the digital roots of m^n, m=1,2,.. |
|
+0
2
|
|
| 9, 1001, 50, 333, 1001, 100, 333, 11, 5, 9, 1001, 50, 333, 1001, 100, 333, 11, 5, 9, 1001, 50, 333, 1001, 100, 333, 11, 5, 9, 1001, 50, 333, 1001, 100, 333, 11, 5, 9, 1001, 50, 333, 1001, 100, 333, 11, 5, 9, 1001, 50, 333, 1001, 100, 333, 11, 5, 9, 1001, 50, 333, 1001
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
FORMULA
|
The digital root of a number m > 0, is d = m mod 9 if d > 0 else d = 9.
|
|
EXAMPLE
|
Digital roots of 4^n = 1,4,7,1,4,7,1,4,7,1,4,7,.. 49/333 = 0.147147147147147147147147147147147,.. 333 is the 4-th entry in the sequence.
|
|
PROGRAM
|
(PARI) f(n, m) = for(x=0, n, print1(droot(m^x)", ")) droot(n) = \ the digital root of a number. { local(x); x= n%9; if(x>0, return(x), return(9)) }
|
|
CROSSREFS
|
Cf. A100579.
Sequence in context: A048561 A112909 A083909 this_sequence A004809 A099127 A054344
Adjacent sequences: A100598 A100599 A100600 this_sequence A100602 A100603 A100604
|
|
KEYWORD
|
base,frac,nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Jan 02 2005
|
|
|
Search completed in 0.002 seconds
|
