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 A225442 #12 Aug 16 2019 14:03:15 %S A225442 7,3,4,7,5,2,2,0,4,1,9,0,8,3,4,1,0,5,3,3,0,9,6,5,3,4,9,0,4,7,7,0,5,1, %T A225442 3,8,2,2,9,9,9,1,8,0,6,9,5,8,3,9,8,1,4,6,7,1,1,3,0,5,0,5,2,2,8,8,5,7, %U A225442 7,9,5,1,5,8,3,6,5,0,4,7,7,9,0,1,3,7,7,9,2,8,9,8,4,4,2,7,6,5,4,3 %N A225442 10-adic integer x such that x^7 = -1/3. %H A225442 Seiichi Manyama, <a href="/A225442/b225442.txt">Table of n, a(n) for n = 0..10000</a> %e A225442 7^7 == 3 (mod 10). %e A225442 37^7 == 33 (mod 10^2). %e A225442 437^7 == 333 (mod 10^3). %e A225442 7437^7 == 3333 (mod 10^4). %e A225442 57437^7 == 33333 (mod 10^5). %e A225442 257437^7 == 333333 (mod 10^6). %o A225442 (PARI) n=0;for(i=1,100,m=(10^i-1)/3;for(x=0,9,if(((n+(x*10^(i-1)))^7)%(10^i)==m,n=n+(x*10^(i-1));print1(x", ");break))) %o A225442 (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 %K A225442 nonn,base %O A225442 0,1 %A A225442 _Aswini Vaidyanathan_, May 11 2013