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 A248136 #10 Oct 02 2014 05:03:01
%S A248136 1,20,3,6,1,4,200,299,5,29,4,119,5,61,3,3,6,64,31,2,21,35,6,2974,17,
%T A248136 1052,27,109,10,4,3,50,65,177,22,29,5,25,15,29,29,584,83,163,9,152,19,
%U A248136 19,29,32,15,35,4,25,239,1122,185,76,35,97
%N A248136 Least positive integer m such that m + n divides D(m) + D(n), where D(.) is given by A001850.
%C A248136 Conjecture: a(n) exists for any n > 0.
%H A248136 Zhi-Wei Sun, <a href="/A248136/b248136.txt">Table of n, a(n) for n = 1..10000</a>
%e A248136 a(2) = 20 since 2 + 20 = 22 divides D(2) + D(20) = 13 + 260543813797441 = 260543813797454 = 22*11842900627157.
%t A248136 d[n_]:=Sum[Binomial[n,k]Binomial[n+k,k],{k,0,n}]
%t A248136 Do[m=1;Label[aa];If[Mod[d[m]+d[n],m+n]==0,Print[n," ",m];Goto[bb]];m=m+1;Goto[aa];Label[bb];Continue,{n,1,60}]
%Y A248136 Cf. A001850, A247824, A247937, A247940, A248124, A248125, A248133, A248137, A248139, A248142.
%K A248136 nonn
%O A248136 1,2
%A A248136 _Zhi-Wei Sun_, Oct 02 2014