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 A225211 #20 Dec 21 2023 17:00:26
%S A225211 2,3,4,7,8,20,26,31,127,532,954,2186,2524,8191,104944,131071,524287,
%T A225211 918080,1594322,10368512,26100416,2147483647,24708617408,25316030960,
%U A225211 35053995440,45883878740
%N A225211 Numbers n such that sigma(n+1) - sigma(n) divides n.
%C A225211 Supersequence of A000668 (Mersenne primes) and A067803 (numbers n such that sigma(n) - sigma(n+1) = n).
%C A225211 Corresponding integers k such that sigma(n+1) - sigma(n) = n/k: 2, 1, -4, 1, -4, -2, -13, 1, 1, -1, -1, -1093, -2, 1, ....
%C A225211 a(27) > 10^11. - _Donovan Johnson_, May 04 2013
%C A225211 a(27) > 10^13. - _Giovanni Resta_, Aug 01 2013
%e A225211 Number 2186 is in sequence because sigma(2187) - sigma(2186) = 3280 - 3282 = -2 which divides 2186.
%t A225211 Select[Range[1000000], DivisorSigma[1, # + 1] - DivisorSigma[1, #] != 0 && IntegerQ[#/(DivisorSigma[1, # + 1] - DivisorSigma[1, #])] &] (* _T. D. Noe_, May 02 2013 *)
%t A225211 Select[Partition[Table[{n,DivisorSigma[1,n]},{n,16*10^5}],2,1],Divisible[#[[1,1]],#[[1,2]]-#[[2,2]]]&][[All,1,1]]//Quiet (* _Harvey P. Dale_, Jun 27 2020 *)
%t A225211 Position[MapIndexed[Divisible[#2[[1]], #] &, Subtract @@@ Partition[DivisorSigma[1, Range[10^6]], 2, 1]], True] // Flatten // Quiet (* _Eric W. Weisstein_, Dec 21 2023 *)
%o A225211 (PARI) is(n)=my(m=sigma(n+1)-sigma(n)); m && n%m==0 \\ _Charles R Greathouse IV_, May 02 2013
%Y A225211 Cf. A000203, A000668, A067803.
%K A225211 nonn
%O A225211 1,1
%A A225211 _Jaroslav Krizek_, May 01 2013
%E A225211 a(15)-a(21) from _Charles R Greathouse IV_, May 02 2013
%E A225211 a(22)-a(26) from _Donovan Johnson_, May 04 2013