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 A248139 #8 Oct 02 2014 05:04:15
%S A248139 1,1,25,6,14,4,13,49,19,10,2,56,2,5,6,5,27,61,9,33,23,53,21,15,3,24,
%T A248139 11,58,39,118,3,1598,20,40,4,2,58,26,29,17,47,34,4,31,43,163,41,25,8,
%U A248139 26,67,40,21,214,535,12,7,22,164,74
%N A248139 Least positive integer m such that m + n divides f(m) + f(n), where f(.) is given by A000172.
%C A248139 Conjecture: a(n) exists for any n > 0.
%H A248139 Zhi-Wei Sun, <a href="/A248139/b248139.txt">Table of n, a(n) for n = 1..10000</a>
%e A248139 a(5) = 14 since 5 + 14 = 19 divides f(5) + f(14) = 2252 + 112738423360 = 112738425612 = 19*5933601348.
%t A248139 f[n_]:=Sum[Binomial[n,k]^3,{k,0,n}]
%t A248139 Do[m=1; Label[aa]; If[Mod[f[m]+f[n], m+n]==0, Print[n, " ", m]; Goto[bb]]; m=m+1; Goto[aa]; Label[bb]; Continue, {n, 1, 60}]
%Y A248139 Cf. A000172, A247824, A247937, A247940, A248124, A248125, A248133, A248136, A248137, A248142.
%K A248139 nonn
%O A248139 1,3
%A A248139 _Zhi-Wei Sun_, Oct 02 2014