The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A225444 10-adic integer x such that x^7 = 3. 2
 7, 2, 6, 1, 5, 9, 6, 2, 8, 3, 7, 8, 8, 7, 9, 3, 6, 0, 9, 3, 4, 8, 1, 3, 8, 2, 7, 6, 2, 0, 5, 7, 4, 8, 4, 1, 7, 6, 4, 5, 3, 5, 1, 1, 5, 1, 0, 9, 6, 1, 7, 8, 6, 2, 0, 6, 2, 7, 7, 9, 5, 1, 7, 1, 3, 6, 0, 6, 5, 4, 8, 9, 1, 5, 3, 5, 9, 7, 2, 9, 3, 1, 4, 8, 3, 5, 8, 7, 3, 1, 0, 5, 5, 9, 0, 0, 7, 0, 8, 6 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Seiichi Manyama, Table of n, a(n) for n = 0..10000 EXAMPLE 7^7 == 3 (mod 10). 27^7 == 3 (mod 10^2). 627^7 == 3 (mod 10^3). 1627^7 == 3 (mod 10^4). 51627^7 == 3 (mod 10^5). 951627^7 == 3 (mod 10^6). PROG (PARI) n=0; for(i=1, 100, m=3; 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((3+O(2^N))^(1/7), 2^N), Mod((3+O(5^N))^(1/7), 5^N)))), N) \\ Seiichi Manyama, Aug 06 2019 CROSSREFS Sequence in context: A117029 A128475 A309647 * A175408 A019934 A295874 Adjacent sequences: A225441 A225442 A225443 * A225445 A225446 A225447 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 27 16:57 EDT 2024. Contains 372880 sequences. (Running on oeis4.)