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 A248144 #9 Oct 03 2014 16:54:40
%S A248144 4,5,3,1,2,14,2,10,1,4,17,5,9,1,1,6,4,10,16,357,1,197,14,1,3,9,6,1123,
%T A248144 15,93,4,1,8,46,77,99,18,53,10,76,4,2,15,152,4,3,10,29,6,12,4,1,25,1,
%U A248144 252,64,106,11,11,136
%N A248144 Least positive integer m such that m + n divides p(m*n), where p(.) is the partition function given by A000041.
%C A248144 Conjecture: a(n) exists for any n > 0.
%H A248144 Zhi-Wei Sun, <a href="/A248144/b248144.txt">Table of n, a(n) for n = 1..496</a>
%e A248144 a(6) = 14 since 6 + 14 = 20 divides p(6*14) = 26543660.
%t A248144 Do[m=1;Label[aa];If[Mod[PartitionsP[m*n],m+n]==0,Print[n," ",m];Goto[bb]];m=m+1;Goto[aa];Label[bb];Continue,{n,1,60}]
%Y A248144 Cf. A000041, A248004, A248008, A248143, A248175.
%K A248144 nonn
%O A248144 1,1
%A A248144 _Zhi-Wei Sun_, Oct 02 2014