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 A004681 #22 Sep 08 2022 08:44:33 %S A004681 2,3,5,10,14,16,23,25,32,41,43,52,56,61,65,104,113,115,124,131,133, %T A004681 142,146,155,166,203,205,212,214,221,241,245,254,256,302,304,313,322, %U A004681 326,335,344,346,362,364,401,403,421,436,443,445,452,461,463,506,515,524 %N A004681 Primes written in base 7. %H A004681 Vincenzo Librandi, <a href="/A004681/b004681.txt">Table of n, a(n) for n = 1..1000</a> %F A004681 a(n) = A007093(prime(n)). - _Michel Marcus_, Sep 03 2016 %t A004681 FromDigits/@IntegerDigits[Prime[Range[1000]], 7] (* _Vincenzo Librandi_, Sep 03 2016 *) %o A004681 (PARI) a(n)=subst(Pol(digits(prime(n),7)),'x,10) \\ _Charles R Greathouse IV_, Nov 06 2013 %o A004681 (PARI) vector(60, n, fromdigits(digits(prime(n), 7))) \\ _G. C. Greubel_, Oct 10 2018 %o A004681 (Magma) [Seqint(Intseq(NthPrime(n),7)): n in [1..60]]; // _G. C. Greubel_, Oct 10 2018 %Y A004681 Cf. similar sequences listed in A004680. %Y A004681 Cf. A007093. %K A004681 nonn,easy,base %O A004681 1,1 %A A004681 _N. J. A. Sloane_