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 A254339 #6 May 13 2015 13:34:17 %S A254339 1,4,7,6,8,4,7,9,7,6,8,8,9,8,4,7,7,9,7,6,8,6,8,9,8,8,8,9,9,9,8,4,7,7, %T A254339 7,9,9,7,6,8,8,9,8,6,8,8,9,8,8,9,8,8,9,9,9,9,9,8,4,7,7,7,7,9,9,7,6,8, %U A254339 6,8,9,8,8,8,9,9,9,8,6,8,8,8,9,9,8,8 %N A254339 Final digits of A254143 in decimal representation. %C A254339 a(n) = A254143(n) mod 10; %C A254339 also final digits of A254323: a(n) = A254323(n) mod 10. %H A254339 Reinhard Zumkeller, <a href="/A254339/b254339.txt">Table of n, a(n) for n = 1..10000</a> %H A254339 <a href="/index/Fi#final">Index entries for sequences related to final digits of numbers</a> %o A254339 (Haskell) %o A254339 a254339 = flip mod 10 . a254143 %o A254339 (PARI) listA237424(lim)=my(v=List(),a,t); while(1, for(b=0,a, t=(10^a+10^b+1)/3; if(t>lim, return(Set(v))); listput(v, t)); a++) %o A254339 do(lim)=my(v=List(),u=listA237424(lim),t); for(i=1,#u, for(j=1,i, t=u[i]*u[j]; if(t>lim,break); listput(v,t))); apply(n->n%10, Set(v)) \\ _Charles R Greathouse IV_, May 13 2015 %Y A254339 Cf. A254143, A254323, A010879, A254398, A254338. %K A254339 nonn,base %O A254339 1,2 %A A254339 _Reinhard Zumkeller_, Feb 23 2015