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 A074757 #15 Feb 14 2019 12:28:55
%S A074757 34,46,62,74,86,94,142,188,202,214,218,231,243,244,262,278,302,356,
%T A074757 375,394,422,423,428,436,446,459,478,494,584,596,604,621,628,634,664,
%U A074757 698,716,837,861,885,903,916,922,944,956,982,1004,1017,1018,1028,1042,1052
%N A074757 Numbers n such that tau(n) = (tau(n+1)+tau(n-1))/2.
%H A074757 Harvey P. Dale, <a href="/A074757/b074757.txt">Table of n, a(n) for n = 1..1000</a>
%H A074757 Vaclav Kotesovec, <a href="/A074757/a074757.jpg">Plot of a(n)/n for n = 1..1000000</a>
%H A074757 Vaclav Kotesovec, <a href="/A074757/a074757_1.jpg">Plot of a(n)/(n*log(log(n))) for n = 1..1000000</a>
%F A074757 a(n) seems to be asymptotic to c*n with c around 23. [This conjecture is false. The limit a(n)/n, if it exists, is > 29, see graphs. - _Vaclav Kotesovec_, Feb 14 2019]
%t A074757 okQ[{a_,b_,c_}]:=(a+c)/2==b; Flatten[Position[Partition[DivisorSigma[0, Range[1100]],3,1],_?okQ]]+1 (* _Harvey P. Dale_, Aug 17 2013 *)
%Y A074757 Cf. A090502.
%K A074757 easy,nonn
%O A074757 1,1
%A A074757 _Benoit Cloitre_, Sep 28 2002