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 A248142 #5 Oct 02 2014 05:04:33
%S A248142 1,1,7,2238,5,9,3,3,1,2484,2,2,26,12,24,5,41,32,14,3,29,29,6,15,30,7,
%T A248142 8,37,21,5,44,18,5,16,39,34,8,1,6,5,17,8,26,6,865,39,8,13,16,781,356,
%U A248142 35,184,65,30,139,18,25,16,123
%N A248142 Least positive integer m such that m + n divides A(m) + A(n), where A(.) is given by A005259.
%C A248142 Conjecture: a(n) exists for any n > 0.
%H A248142 Zhi-Wei Sun, <a href="/A248142/b248142.txt">Table of n, a(n) for n = 1..2853</a>
%e A248142 a(3) = 7 since 3 + 7 = 10 divides A(3) + A(7) = 1445 + 584307365 = 584308810.
%t A248142 A[0]=1;A[1]=5
%t A248142 A[n_]:=((2n-1)(17*n(n-1)+5)*A[n-1]-(n-1)^3*A[n-2])/n^3
%t A248142 Do[m=1; Label[aa]; If[Mod[A[m]+A[n], m+n]==0, Print[n, " ", m]; Goto[bb]]; m=m+1; Goto[aa]; Label[bb]; Continue, {n, 1, 60}]
%Y A248142 Cf. A005259, A247824, A247937, A247940, A248124, A248125, A248133, A248136, A248137, A248139.
%K A248142 nonn
%O A248142 1,3
%A A248142 _Zhi-Wei Sun_, Oct 02 2014