This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A225457 #11 Aug 16 2019 14:03:33 %S A225457 7,0,6,9,4,2,3,0,7,3,6,7,9,6,2,6,7,7,2,1,4,0,9,2,6,5,6,9,7,8,9,8,9,7, %T A225457 5,0,3,7,3,7,8,5,2,8,0,3,2,6,6,3,1,3,4,1,3,7,5,3,4,5,3,4,6,5,3,5,8,0, %U A225457 9,6,7,3,9,1,6,4,4,5,9,3,8,4,1,8,6,4,1,8,5,9,6,2,6,4,3,3,3,1,9,0 %N A225457 10-adic integer x such that x^9 = 7. %H A225457 Seiichi Manyama, <a href="/A225457/b225457.txt">Table of n, a(n) for n = 0..10000</a> %e A225457 7^9 == 7 (mod 10). %e A225457 7^9 == 7 (mod 10^2). %e A225457 607^9 == 7 (mod 10^3). %e A225457 9607^9 == 7 (mod 10^4). %e A225457 49607^9 == 7 (mod 10^5). %e A225457 249607^9 == 7 (mod 10^6). %o A225457 (PARI) n=0;for(i=1,100,m=7;for(x=0,9,if(((n+(x*10^(i-1)))^9)%(10^i)==m,n=n+(x*10^(i-1));print1(x", ");break))) %o A225457 (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 07 2019 %K A225457 nonn,base %O A225457 0,1 %A A225457 _Aswini Vaidyanathan_, May 11 2013