A309823 Digits of the 10-adic integer (123456789/(1-10^9))^(1/9).

9, 0, 7, 6, 0, 0, 6, 1, 6, 9, 1, 8, 2, 2, 4, 2, 2, 4, 8, 1, 1, 7, 6, 7, 7, 9, 4, 7, 2, 7, 2, 8, 1, 4, 3, 7, 5, 2, 9, 9, 1, 1, 2, 2, 9, 5, 0, 1, 2, 6, 3, 8, 3, 6, 1, 8, 3, 2, 0, 0, 3, 9, 1, 1, 1, 5, 8, 4, 3, 3, 3, 8, 1, 1, 9, 0, 9, 4, 7, 3, 8, 7, 4, 5, 7, 9, 2, 6, 3, 8, 3, 2, 1, 9, 9, 4, 0, 2, 2, 4

Offset: 0

Author

Seiichi Manyama, Aug 18 2019

Keywords

• nonn
• base

Comments

x = ...734182727497767118422422819616006709.

x^9 = ...123456789123456789123456789123456789.

Examples

			          9^9 == 9         (mod 10).
          9^9 == 89        (mod 10^2).
        709^9 == 789       (mod 10^3).
       6709^9 == 6789      (mod 10^4).
       6709^9 == 56789     (mod 10^5).
       6709^9 == 456789    (mod 10^6).
    6006709^9 == 3456789   (mod 10^7).
   16006709^9 == 23456789  (mod 10^8).
  616006709^9 == 123456789 (mod 10^9).
		

Links

• Seiichi Manyama, Table of n, a(n) for n = 0..10000

Crossrefs

Digits of the 10-adic integer (123456789/(1-10^9))^(1/k): A309821 (k=3), A309822 (k=7), this sequence (k=9).

Cf. A309820.

Programs

PARI

N=100; M=123456789/(1-10^9); Vecrev(digits(lift(chinese(Mod((M+O(2^N))^(1/9), 2^N), Mod((M+O(5^N))^(1/9), 5^N)))), N)