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 A048891 #38 Feb 23 2020 08:42:38
%S A048891 2,3,11,13,37,43,1087,64591,64601,64661,1304707,3523969,3524249,
%T A048891 9558541,189963073,189963091,189963847,189968887,189969319,189969337,
%U A048891 1394194181,1394194481,1394194561,1394197381,1394199221,1394199241,3779851321,3779851363,3779856571,10246935931,10246936019,10246936481,75370121689,75370121857,75370122409,75370125409,75370126441
%N A048891 Primes that are congruent to 1 mod n, where n is the index of the prime.
%C A048891 Based on problem by _G. L. Honaker, Jr._
%C A048891 A subsequence of A073465. - _Ivan N. Ianakiev_, Aug 06 2019
%H A048891 Giovanni Resta, <a href="/A048891/b048891.txt">Table of n, a(n) for n = 1..94</a>
%F A048891 A087611(a(n)) = 0. - _Reinhard Zumkeller_, Sep 11 2003
%F A048891 a(n) = A000040(A023143(n)). - _Zak Seidov_, Feb 19 2015
%e A048891 13 is the 6th prime and 13 == 1 mod 6.
%t A048891 f[p_,n_]:=Mod[p,n]==0; lst={};Do[p=Prime[n];If[f[p-1,n],AppendTo[lst,p]],{n,10!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Dec 08 2009 *)
%o A048891 (PARI) lista(nn) = forprime(p=1, nn, if (Mod(p, primepi(p)) == 1, print1(p, ", "))); \\ _Michel Marcus_, Jan 08 2015; Aug 06 2019
%Y A048891 Cf. A000040, A023143, A045924, A052013.
%K A048891 nonn
%O A048891 1,1
%A A048891 _Jud McCranie_
%E A048891 More terms from _Zak Seidov_, Feb 19 2015
%E A048891 Terms a(33)-a(37) sorted into correct order by _Giovanni Resta_, Feb 23 2020