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 A248197 #9 Oct 04 2014 04:11:30
%S A248197 1,9,4,1,17,12,3,4,2,4,15,6,1,20,4,74,4,3,2,8,9,5,3,17,5,9,8,26,8,1,
%T A248197 14,4,17,35,33,52,29,46,35,95,4,4,23,24,23,38,135,64,11,62,222,36,92,
%U A248197 41,1,39,6,37,3,18
%N A248197 Least positive integer m such that m + n divides prime(prime(m)) + prime(prime(n)).
%C A248197 Conjecture: a(n) exists for any n > 0. Moreover, a(n) < n*(n-1) if n > 2.
%H A248197 Zhi-Wei Sun, <a href="/A248197/b248197.txt">Table of n, a(n) for n = 1..10000</a>
%H A248197 Zhi-Wei Sun, <a href="http://arxiv.org/abs/1409.5685">A new theorem on the prime-counting function</a>, arXiv:1409.5685, 2014.
%e A248197 a(3) = 4 since 3 + 4 = 7 divides prime(prime(3)) + prime(prime(4)) = prime(5) + prime(7) = 11 + 17 = 28.
%e A248197 a(2479) = 3386154 since 2479 + 3386154 = 3388633 divides prime(prime(2479)) + prime(prime(3386154)) = prime(22111) + prime(56851657) = 250963 + 1124775193 = 1125026156 = 332*3388633.
%t A248197 Do[m=1;Label[aa];If[Mod[Prime[Prime[m]]+Prime[Prime[n]],m+n]==0,Print[n," ",m];Goto[bb]];m=m+1;Goto[aa];Label[bb];Continue,{n,1,60}]
%Y A248197 Cf. A000040, A247824, A247975.
%K A248197 nonn
%O A248197 1,2
%A A248197 _Zhi-Wei Sun_, Oct 03 2014