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 A071572 #6 Mar 30 2012 18:35:41
%S A071572 1,2,2,1,2,1,5,1,1,2,1,1,2,1,1,1,2,1,1,3,1,1,1,1,1,2,1,2,1,1,1,1,3,1,
%T A071572 2,1,1,1,1,1,2,1,2,1,4,1,1,1,5,1,1,2,1,1,1,1,5,1,1,2,1,1,1,2,1,1,1,1,
%U A071572 3,1,1,1,1,1,1,1,1,1,1,1,2,1,2,1,1,1,1,1,3,1,1,1,1,1,1,1,1,3,1,1,1,1,1,5,1
%N A071572 Least k such that nextprime(k*prime(n)) - k*prime(n) is nonprime.
%C A071572 The first time a value of m appears is when n equals 1, 2, 20, 45, 7. I can find no value greater than 5 for n's up through 12,500,000.
%t A071572 NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; f[n_] := Block[{k = 1}, While[ PrimeQ[ NextPrim[k*Prime[n]] - k*Prime[n]], k++ ]; k]; Table[ f[n], {n, 1, 105}]
%K A071572 nonn
%O A071572 1,2
%A A071572 _David W. Wilson_ and _Robert G. Wilson v_, May 31 2002