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 A225460 #16 Aug 16 2019 11:53:07 %S A225460 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, %T A225460 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, %U A225460 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 %N A225460 10-adic integer x such that x^9 = -7. %C A225460 This is the 10's complement of A225457. %H A225460 Seiichi Manyama, <a href="/A225460/b225460.txt">Table of n, a(n) for n = 0..10000</a> %e A225460 3^9 == -7 (mod 10). %e A225460 93^9 == -7 (mod 10^2). %e A225460 393^9 == -7 (mod 10^3). %e A225460 393^9 == -7 (mod 10^4). %e A225460 50393^9 == -7 (mod 10^5). %e A225460 750393^9 == -7 (mod 10^6). %o A225460 (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))) %o A225460 (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 %Y A225460 Cf. A225408, A225457. %K A225460 nonn,base %O A225460 0,1 %A A225460 _Aswini Vaidyanathan_, May 11 2013