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 A060282 #27 Apr 29 2020 10:01:29 %S A060282 0,3,0,142857,9,76923,588235294117647,52631578947368421, %T A060282 434782608695652173913,344827586206896551724137931,32258064516129,27, %U A060282 2439,23255813953488372093,212765957446808510638297872340425531914893617 %N A060282 Periodic part of decimal expansion of reciprocal of n-th prime (leading 0's omitted). %H A060282 T. D. Noe, <a href="/A060282/b060282.txt">Table of n, a(n) for n=1..100</a> %F A060282 a(n) = floor(10^A002371(n)/prime(n)). %F A060282 a(n) = 0 if and only if n = 1 or 3, corresponding to the primes 2 and 5, which are factors of 10. - _Alonso del Arte_, Apr 03 2020 %F A060282 ceiling(log_10(a(n))) = prime(n) - 1 if prime(n) is a full reptend prime (A001913). - _Alonso del Arte_, Apr 14 2020 %e A060282 1/7 = 0.142857142..., so a(4) = 142857. %e A060282 1/11 = 0.09090909..., so a(5) = 9. %t A060282 primePer[1] = primePer[3] = 0; primePer[n_] := FromDigits[(d = RealDigits[1/Prime[n]])[[1, 1]]] * 10^d[[2]]; Array[ primePer, 15] (* _Amiram Eldar_, Apr 28 2020 *) %o A060282 (PARI) f(n)=if(n<4,n==2,znorder(Mod(10, prime(n)))) \\ A002371 %o A060282 for(n=1,100,print1(floor(10^f(n)/prime(n)),",")) %Y A060282 Cf. A002371, A036275, A060283, A060251, A036275, A001913. %K A060282 nonn,easy,base %O A060282 1,2 %A A060282 _N. J. A. Sloane_, Mar 30 2001 %E A060282 More terms from _Klaus Brockhaus_, Mar 30 2001