login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A309822
Digits of the 10-adic integer (123456789/(1-10^9))^(1/7).
4
9, 6, 6, 2, 7, 2, 7, 9, 1, 5, 2, 3, 8, 4, 6, 6, 9, 4, 7, 3, 2, 7, 8, 7, 5, 7, 6, 1, 9, 2, 7, 2, 4, 0, 6, 3, 0, 8, 5, 6, 7, 5, 1, 4, 7, 8, 0, 1, 4, 4, 4, 7, 3, 7, 4, 6, 8, 9, 1, 2, 7, 4, 3, 8, 4, 0, 3, 6, 8, 2, 3, 7, 5, 6, 0, 5, 5, 2, 9, 8, 5, 8, 9, 6, 6, 5, 3, 3, 0, 6, 5, 3, 6, 1, 5, 6, 9, 6, 7, 1
OFFSET
0,1
COMMENTS
x = ...360427291675787237496648325197272669.
x^7 = ...123456789123456789123456789123456789.
LINKS
EXAMPLE
9^7 == 9 (mod 10).
69^7 == 89 (mod 10^2).
669^7 == 789 (mod 10^3).
2669^7 == 6789 (mod 10^4).
72669^7 == 56789 (mod 10^5).
272669^7 == 456789 (mod 10^6).
7272669^7 == 3456789 (mod 10^7).
97272669^7 == 23456789 (mod 10^8).
197272669^7 == 123456789 (mod 10^9).
PROG
(PARI) N=100; M=123456789/(1-10^9); Vecrev(digits(lift(chinese(Mod((M+O(2^N))^(1/7), 2^N), Mod((M+O(5^N))^(1/7), 5^N)))), N)
CROSSREFS
Digits of the 10-adic integer (123456789/(1-10^9))^(1/k): A309821 (k=3), this sequence (k=7), A309823 (k=9).
Cf. A309819.
Sequence in context: A354295 A100044 A327956 * A195365 A092513 A260315
KEYWORD
nonn,base
AUTHOR
Seiichi Manyama, Aug 18 2019
STATUS
approved