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 A074208 #32 Nov 20 2017 23:43:41
%S A074208 2,6,4,9,14,6,8,10,15,14,20,24,27,22,16,12,39,24,48,34,18,20,52,90,40,
%T A074208 46,42,28,68,78,32,56,45,62,84,24,70,48,66,44,63,30,50,82,78,52,116,
%U A074208 90,75,40,132,96,80,42,36,106,99,68,148,120,130,118,64,56,117,54,136,112
%N A074208 Least k > 1 such that n divides sigma(k) - k.
%H A074208 Ivan Neretin, <a href="/A074208/b074208.txt">Table of n, a(n) for n = 1..10000</a>
%F A074208 Conjecture: Sum_{k=1..n} a(k) = O(n^{2+epsilon}) for any epsilon > 0.
%F A074208 Between n = 90000 and 100000, Sum_{k=1..n} a(k)/n^2 slowly but not monotonically increases from 1.0007 to 1.0023. At n = 10^6, it's about 1.0147. - _David A. Corneth_, Oct 23 2017
%t A074208 a = ConstantArray[1, 68]; k = 1; While[Length[vac = Flatten[Position[a, 1]]] > 0, k++; a[[Intersection[Divisors[DivisorSigma[1, k] - k], vac]]] *= k]; a (* _Ivan Neretin_, May 15 2015 *)
%t A074208 lk[n_]:=Module[{k=2},While[!Divisible[DivisorSigma[1,k]-k,n],k++];k]; Array[lk,70] (* _Harvey P. Dale_, Oct 23 2017 *)
%o A074208 (PARI) a(n)=if(n<0,0,s=2; while((sigma(s)-s)%n>0,s++); s)
%o A074208 (PARI) first(n)=my(res = vector(n), todo = n - 1, k = 2); res[1] = 2; while(todo > 0, d = divisors(sigma(k) - k); for(i=2, #d, if(d[i] <= n && res[d[i]] == 0, res[d[i]] = k; todo--)); k++); res \\ _David A. Corneth_, Oct 23 2017
%Y A074208 Cf. A070982.
%K A074208 nonn,easy
%O A074208 1,1
%A A074208 _Benoit Cloitre_, Sep 17 2002