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 A198195 #12 Feb 13 2013 23:58:29 %S A198195 509,31,7,7,7,19,13,3,3,3,97,11,17,41,41,11,2,313,2,2,137,2,2,281,227, %T A198195 149,149,197,281,191,101,569,191,857,827,311,569,599,431,599,1451, %U A198195 1091,809,1019,419,1667,2237,4517,5009,3671,1997,1289,1451,3329,3329 %N A198195 a(n) is the smallest prime(m) such that the interval (prime(m)*n, prime(m+1)*n) contains exactly five primes. %C A198195 Conjecture. In the supposition that there are infinitely many twin primes, every term beginning with the 20th is 2 or in A001359 (lesser of twin primes). The sequence is unbounded. %H A198195 Alois P. Heinz, <a href="/A198195/b198195.txt">Table of n, a(n) for n = 2..100</a> %e A198195 Let n=14, and consider intervals of the form (14*prime(m), 14*prime(m+1)). %e A198195 For 2, 3, 5, ..., the intervals (28,42), (42,70), (70,98), (98,154), (154,182), (182,238), (238,266)... contain 4, 6, 6, 11, 6, 9, 5,... primes. Hence the smallest such prime is 17. %Y A198195 Cf. A195871, A187809, A187810, A187812. %K A198195 nonn %O A198195 2,1 %A A198195 _Vladimir Shevelev_ and _Peter J. C. Moses_, Jan 07 2013