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 A096399 #53 Mar 01 2025 03:19:37
%S A096399 5775,5984,7424,11024,21735,21944,26144,27404,39375,43064,49664,56924,
%T A096399 58695,61424,69615,70784,76544,77175,79695,81080,81675,82004,84524,
%U A096399 84644,89775,91664,98175,103455,104895,106784,109395,111824,116655,116864,120015,121904,122264
%N A096399 Numbers k such that both k and k+1 are abundant.
%C A096399 Numbers k such that both sigma(k) > 2k and sigma(k+1) > 2*(k+1).
%C A096399 Numbers k such that both k and k+1 are in A005101.
%C A096399 Set difference of sequences A103289 and {2^m-1} for m in A103291.
%C A096399 The numbers of terms not exceeding 10^k, for k = 4, 5, ..., are 3, 27, 357, 3723, 36640, 365421, 3665799, 36646071, ... . Apparently, the asymptotic density of this sequence exists and equals 0.000366... . - _Amiram Eldar_, Sep 02 2022
%H A096399 T. D. Noe, <a href="/A096399/b096399.txt">Table of n, a(n) for n = 1..10000</a>
%H A096399 Yong-Gao Chen and Hui Lv, <a href="http://arxiv.org/abs/1603.06176">On consecutive abundant numbers</a>, arXiv:1603.06176 [math.NT], 2016.
%H A096399 Paul Erdős, <a href="http://www.renyi.hu/~p_erdos/1935-03.pdf">Note on consecutive abundant numbers</a>, J. London Math. Soc., 10 (1935), 128-131.
%H A096399 Carlos Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_878.htm">Puzzle 878. Consecutive abundant integers</a>, The Prime Puzzles and Problems Connection.
%F A096399 a(n) = A005101(A169822(n)). - _Amiram Eldar_, Mar 01 2025
%e A096399 sigma(5775) = sigma(3*5*5*7*11) = 11904 > 2*5775.
%e A096399 sigma(5776) = sigma(2*2*2*2*19*19) = 11811 > 2*5776.
%t A096399 fQ[n_] := DivisorSigma[1, n] > 2 n; Select[ Range@ 117000, fQ[ # ] && fQ[ # + 1] &] (* _Robert G. Wilson v_, Jun 11 2010 *)
%t A096399 Select[Partition[Select[Range[120000], DivisorSigma[1, #] > 2 # &], 2, 1], Differences@ # == {1} &][[All, 1]] (* _Michael De Vlieger_, May 20 2017 *)
%o A096399 (PARI) for(i=1,1000000,if(sigma(i)>2*i && sigma(i+1)>2*(i+1),print(i))); \\ _Max Alekseyev_, Jan 28 2005
%Y A096399 Cf. A000203, A005101, A023196, A103289, A103291, A169822.
%K A096399 nonn
%O A096399 1,1
%A A096399 _John L. Drost_, Aug 06 2004
%E A096399 Two further terms from _Max Alekseyev_, Jan 28 2005
%E A096399 Entry revised by _N. J. A. Sloane_, Dec 03 2006
%E A096399 Edited by _T. D. Noe_, Nov 15 2010