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 A230115 #26 Dec 06 2019 15:49:36
%S A230115 5,7,13,27,37,51,61,62,73,74,91,115,123,146,153,157,164,187,188,193,
%T A230115 206,235,245,267,274,277,278,284,291,313,355,356,362,369,386,397,403,
%U A230115 411,421,422,423,425,427,428,451,457,538,541,605,613,637,657,661,667,673
%N A230115 Numbers n such that tau(n+1) - tau(n) = 2; where tau(n) = the number of divisors of n (A000005).
%C A230115 Numbers n such that A051950(n+1) = 2.
%C A230115 Numbers n such that A049820(n) - A049820(n+1) = 1.
%C A230115 Sequence of starts of first run of n (n>=2) consecutive integers m_1, m_2, ..., m_n such that tau(m_k) - tau(m_k-1) = 2, for all k=n...2: 5, 61, 421, ... (a(5) > 100000); example for n=4: tau(421) = 2, tau(422) = 4, tau(423) = 6, tau(424) = 8.
%H A230115 Jaroslav Krizek, <a href="/A230115/b230115.txt">Table of n, a(n) for n = 1..2000</a>
%e A230115 Number 7 is in sequence because tau(8) - tau(7) = 4 - 2 = 2.
%t A230115 Select[ Range[ 50000], DivisorSigma[0, # ] + 2 == DivisorSigma[0, # + 1] &]
%t A230115 Flatten[Position[Partition[DivisorSigma[0,Range[700]],2,1],_? (#[[2]]- #[[1]] == 2&),{1},Heads->False]] (* _Harvey P. Dale_, Aug 03 2014 *)
%o A230115 (PARI) isok(n) = (numdiv(n+1) - numdiv(n)) == 2; \\ _Michel Marcus_, Mar 26 2017
%o A230115 (Python)
%o A230115 from sympy.ntheory import divisor_count
%o A230115 [n for n in range(1000) if divisor_count(n + 1) - divisor_count(n) == 2] # _Indranil Ghosh_, Mar 26 2017
%Y A230115 Cf. A000005, A055927 (numbers n such that tau(n+1) - tau(n) = 1).
%Y A230115 Subsequence of A162318. - _Michel Marcus_, Mar 26 2017
%K A230115 nonn
%O A230115 1,1
%A A230115 _Jaroslav Krizek_, Oct 09 2013