This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A225460 10-adic integer x such that x^9 = -7. 1
 3, 9, 3, 0, 5, 7, 6, 9, 2, 6, 3, 2, 0, 3, 7, 3, 2, 2, 7, 8, 5, 9, 0, 7, 3, 4, 3, 0, 2, 1, 0, 1, 0, 2, 4, 9, 6, 2, 6, 2, 1, 4, 7, 1, 9, 6, 7, 3, 3, 6, 8, 6, 5, 8, 6, 2, 4, 6, 5, 4, 6, 5, 3, 4, 6, 4, 1, 9, 0, 3, 2, 6, 0, 8, 3, 5, 5, 4, 0, 6, 1, 5, 8, 1, 3, 5, 8, 1, 4, 0, 3, 7, 3, 5, 6, 6, 6, 8, 0, 9 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS This is the 10's complement of A225457. LINKS Seiichi Manyama, Table of n, a(n) for n = 0..10000 EXAMPLE 3^9 == -7 (mod 10).       93^9 == -7 (mod 10^2).      393^9 == -7 (mod 10^3).      393^9 == -7 (mod 10^4).    50393^9 == -7 (mod 10^5).   750393^9 == -7 (mod 10^6). PROG (PARI) n=0; for(i=1, 100, m=(10^i-7); for(x=0, 9, if(((n+(x*10^(i-1)))^9)%(10^i)==m, n=n+(x*10^(i-1)); print1(x", "); break))) (PARI) N=100; Vecrev(digits(lift(chinese(Mod((-7+O(2^N))^(1/9), 2^N), Mod((-7+O(5^N))^(1/9), 5^N)))), N) \\ Seiichi Manyama, Aug 05 2019 CROSSREFS Cf. A225408, A225457. Sequence in context: A257731 A257733 A098323 * A305274 A293382 A016674 Adjacent sequences:  A225457 A225458 A225459 * A225461 A225462 A225463 KEYWORD nonn,base AUTHOR Aswini Vaidyanathan, May 11 2013 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 13 06:26 EST 2019. Contains 329968 sequences. (Running on oeis4.)