The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A225451 10-adic integer x such that x^7 = 1/3. 2
 3, 6, 5, 2, 4, 7, 7, 9, 5, 8, 0, 9, 1, 6, 5, 8, 9, 4, 6, 6, 9, 0, 3, 4, 6, 5, 0, 9, 5, 2, 2, 9, 4, 8, 6, 1, 7, 7, 0, 0, 0, 8, 1, 9, 3, 0, 4, 1, 6, 0, 1, 8, 5, 3, 2, 8, 8, 6, 9, 4, 9, 4, 7, 7, 1, 1, 4, 2, 2, 0, 4, 8, 4, 1, 6, 3, 4, 9, 5, 2, 2, 0, 9, 8, 6, 2, 2, 0, 7, 1, 0, 1, 5, 5, 7, 2, 3, 4, 5, 6 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS This is the 10's complement of A225442. LINKS Seiichi Manyama, Table of n, a(n) for n = 0..10000 EXAMPLE 3^7 == -3      (mod 10).       63^7 == -33     (mod 10^2).      563^7 == -333    (mod 10^3).     2563^7 == -3333   (mod 10^4).    42563^7 == -33333  (mod 10^5).   742563^7 == -333333 (mod 10^6). PROG (PARI) n=0; for(i=1, 100, m=(2*(10^i-1)/3)+1; for(x=0, 9, if(((n+(x*10^(i-1)))^7)%(10^i)==m, n=n+(x*10^(i-1)); print1(x", "); break))) (PARI) N=100; Vecrev(digits(lift(chinese(Mod((1/3+O(2^N))^(1/7), 2^N), Mod((1/3+O(5^N))^(1/7), 5^N)))), N) \\ Seiichi Manyama, Aug 06 2019 CROSSREFS Cf. A225442. Sequence in context: A154008 A144179 A155540 * A131955 A249281 A316169 Adjacent sequences:  A225448 A225449 A225450 * A225452 A225453 A225454 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 8 17:01 EST 2021. Contains 349596 sequences. (Running on oeis4.)