|
Search: id:A100579
|
|
|
| A100579 |
|
Numerator of the best rational approximation to the decimal representation of the digital roots of m^n, m=1,2,.. |
|
+0
2
|
|
| 1, 125, 7, 49, 158, 17, 58, 2, 1, 1, 125, 7, 49, 158, 17, 58, 2, 1, 1, 125, 7, 49, 158, 17, 58, 2, 1, 1, 125, 7, 49, 158, 17, 58, 2, 1, 1, 125, 7, 49, 158, 17, 58, 2, 1, 1, 125, 7, 49, 158, 17, 58, 2, 1, 1, 125, 7, 49, 158, 17, 58, 2, 1, 1, 125, 7, 49, 158, 17, 58, 2, 1, 1, 125, 7, 49
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
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,.. 49 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. A100601.
Sequence in context: A009805 A005080 A013308 this_sequence A088403 A077495 A030668
Adjacent sequences: A100576 A100577 A100578 this_sequence A100580 A100581 A100582
|
|
KEYWORD
|
base,frac,nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Jan 02 2005
|
|
|
Search completed in 0.002 seconds
|
