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 A248568 #7 Oct 08 2014 12:21:51
%S A248568 1,2,6,2,20,4,8,4,12,40,24,6,20,12,24,8,48,16,32,18,24,8,72,12,44,40,
%T A248568 36,24,132,12,56,16,60,96,40,18,180,36,60,36,144,40,80,16,72,20,168,
%U A248568 24,92,88,184,80,276,24,104,42,48,264,312,24
%N A248568 Least positive integer m such that phi(m+n) divides m, where phi(.) is Euler's totient function.
%C A248568 Conjecture: a(n) exists for any n > 0. Moreover, a(n) <= n*(n-1) for all n > 1.
%C A248568 Note that for n > 1 the term a(n) should be even.
%H A248568 Zhi-Wei Sun, <a href="/A248568/b248568.txt">Table of n, a(n) for n = 1..10000</a>
%e A248568 a(10) = 40 since phi(40+10) = 20 divides 40.
%t A248568 Do[m=1;Label[aa];If[Mod[m,phi[m+n]]==0,Print[n," ",m];Goto[bb]];m=m+1;Goto[aa];Label[bb];Continue,{n,1,60}]
%o A248568 (PARI)
%o A248568 a(n)=m=1;while(m%eulerphi(m+n),m++);m
%o A248568 vector(100,n,a(n)) \\ _Derek Orr_, Oct 08 2014
%Y A248568 Cf. A000010, A248007, A248058.
%K A248568 nonn
%O A248568 1,2
%A A248568 _Zhi-Wei Sun_, Oct 08 2014