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 A001916 M4772 N2038 #24 Dec 26 2016 02:03:29
%S A001916 2,3,11,13,19,29,37,41,53,59,61,67,71,79,83,101,107,131,139,149,163,
%T A001916 173,179,181,191,197,199,211,227,239,251,269,271,293,311,317,347,349,
%U A001916 359,373,379,389,401,409,419,421,443,449,461,467,479,491,509,521,523,541,547,557
%N A001916 Primes p such that the congruence 2^x = 5 (mod p) is solvable.
%D A001916 M. Kraitchik, Recherches sur la Théorie des Nombres. Gauthiers-Villars, Paris, Vol. 1, 1924, Vol. 2, 1929, see Vol. 1, p. 64.
%D A001916 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A001916 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A001916 T. D. Noe, <a href="/A001916/b001916.txt">Table of n, a(n) for n = 1..1000</a>
%t A001916 Select[Prime[Range[120]], MemberQ[Table[Mod[2^x-5, #], {x, 0, #}], 0]&] (* _Jean-François Alcover_, Aug 29 2011 *)
%Y A001916 Cf. A001915.
%K A001916 nonn
%O A001916 1,1
%A A001916 _N. J. A. Sloane_
%E A001916 Better description and more terms from _David W. Wilson_, Dec 12 2000
%E A001916 Description corrected by Joe K. Crump (joecr(AT)carolina.rr.com), Jan 17 2001