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 A006035 M5072 #35 Sep 10 2018 13:29:03
%S A006035 19,31,47,59,61,107,337,1061,9511,22051,209359
%N A006035 Numbers n such that (19^n-1)/18 is prime.
%C A006035 No others less than 8011. - Julien Peter Benney (jpbenney(AT)ftml.net), Aug 15 2004
%C A006035 a(9) = 9511 was found by Richard Fischer on Dec 15 2004. - _Alexander Adamchuk_, Feb 11 2007
%D A006035 Ribenboim, Paulo; "The Book Of Prime Number Records"; published 1989 by Springer-Verlag; pages 350-354.
%D A006035 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A006035 Paul Bourdelais, <a href="https://listserv.nodak.edu/cgi-bin/wa.exe?A2=NMBRTHRY;417ab0d6.0906">A Generalized Repunit Conjecture</a>. - _Paul Bourdelais_, Aug 27 2010
%H A006035 H. Dubner, <a href="http://dx.doi.org/10.1090/S0025-5718-1993-1185243-9">Generalized repunit primes</a>, Math. Comp., 61 (1993), 927-930.
%H A006035 H. Dubner, <a href="/A028491/a028491.pdf">Generalized repunit primes</a>, Math. Comp., 61 (1993), 927-930. [Annotated scanned copy]
%H A006035 H. Lifchitz, <a href="http://www.primenumbers.net/Henri/us/MersFermus.htm">Mersenne and Fermat primes field</a>
%H A006035 <a href="/index/Pri#primepop">Index to primes in various ranges</a>, form ((k+1)^n-1)/k
%t A006035 lst={};Do[If[PrimeQ[(19^n-1)/18], Print[n];AppendTo[lst, n]], {n, 10^5}];lst (* _Vladimir Joseph Stephan Orlovsky_, Aug 21 2008 *)
%o A006035 (PARI) is(n)=isprime((19^n-1)/18) \\ _Charles R Greathouse IV_, Apr 28 2015
%K A006035 nonn,more
%O A006035 1,1
%A A006035 _N. J. A. Sloane_
%E A006035 One more term from Herman Jamke (hermanjamke(AT)fastmail.fm), Jan 05 2008
%E A006035 a(11)=209359 corresponds to a probable prime discovered by _Paul Bourdelais_, Aug 27 2010