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 A248366 #13 Jul 20 2015 01:48:31
%S A248366 1,1,5,10,175,22,23,34,35,102,57,54,63,70,345,74,279,198,225,124,127,
%T A248366 294,145,130,149,334,831,164,191,720,183,520,209,486,259,990,231,226,
%U A248366 227,268,663,294,701,326,301,308,335,310,311,790
%N A248366 Least positive integer m such that prime(m+n) - prime(m) divides m + n.
%C A248366 Conjecture: a(n) exists for any n > 0. Moreover, a(n) <= n^2 except for n = 5, 10, 15, 27.
%C A248366 See also A248369 for a similar conjecture.
%H A248366 Zhi-Wei Sun, <a href="/A248366/b248366.txt">Table of n, a(n) for n = 1..10000</a>
%e A248366 a(5) = 175 since prime(175+5) - prime(175) = 1069 - 1039 = 30 divides 175 + 5 = 180.
%t A248366 q[n_]:=q[n]=PartitionsQ[n]
%t A248366 Do[m=1;Label[aa];If[Mod[m+n,Prime[m+n]-Prime[m]]==0,Print[n," ",m];Goto[bb]];m=m+1;Goto[aa];Label[bb];Continue,{n,1,50}]
%o A248366 (PARI)
%o A248366 a(n)=m=1;while((m+n)%(prime(m+n)-prime(m)),m++);m
%o A248366 vector(100,n,a(n)) \\ _Derek Orr_, Oct 05 2014
%Y A248366 Cf. A000040, A247824, A248369.
%K A248366 nonn
%O A248366 1,3
%A A248366 _Zhi-Wei Sun_, Oct 05 2014