This site is supported by donations to The OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A181595 Abundant numbers n for which the abundance d = sigma(n) - 2*n is a proper divisor, that is, d | n. 24
 12, 18, 20, 24, 40, 56, 88, 104, 196, 224, 234, 368, 464, 650, 992, 1504, 1888, 1952, 3724, 5624, 9112, 11096, 13736, 15376, 15872, 16256, 17816, 24448, 28544, 30592, 32128, 77744, 98048, 122624, 128768, 130304, 174592, 396896, 507392 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Union of this sequence and A005820 is A153501. Every even perfect number n = 2^(p-1)*(2^p-1), p and 2^p-1 prime, of A000396 generates three entries: 2*n, 2^p*n and (2^p-1)*n. Every number M=2^(t-1)*P, where P is a prime of the form 2^t-2^k-1, is an entry for which (2^k)|M and sigma(M)-2^k=2*M (see A181701). Conjecture 1: For every k>=1, there exist infinitely many entries m for which (2^k)|m and sigma(m)-2^k = 2*m. Conjecture 2. All entries are even. [Proved to be false, see below. (Ed.)] Conjecture 3. If the suitable (according to the definition) divisor d of an entry is not a power of 2, then it is not suitable divisor for any other entry. Conjecture 4. If a suitable divisor for an even entry is odd, then it is a Mersenne prime (A000043). If Conjectures 3 and 4 are true, then an entry with odd suitable divisor has the form 2^(p-1)*(2^p-1)^2, where p and 2^p-1 are primes. - Vladimir Shevelev, Nov 08 2010 to Dec 16 2010 The only odd term in this sequence < 2*10^12 is 173369889. - Donovan Johnson, Feb 15 2012 173369889 remains only odd term up to 1.4*10^19. - Peter J. C. Moses, Mar 05 2012 These numbers are obviously pseudoperfect (A005835) since they are equal to the sum of all the proper divisors except the one that is the same as the abundance. - Alonso del Arte, Jul 16 2012 LINKS Donovan Johnson, Table of n, a(n) for n = 1..200 Yanbin Li and Qunying Liao, A class of new near-perfect numbers, J. Korean Math. Soc. 52 (2015), No. 4, pp. 751-763. Paul Pollack and Vladimir Shevelev, On perfect and near-perfect numbers, J. Number Theory 132 (2012), pp. 3037-3046. arXiv:1011.6160 X.-Z. Ren, Y.-G. Chen, On near-perfect numbers with two distinct prime factors, Bulletin of the Australian Mathematical Society, No 3 (2013) , available on CJO2013. doi:10.1017/S0004972713000178. M. Tang, X. Z. Ren and M. Li, On near-perfect and deficient-perfect numbers, Colloq. Math. 133 (2013), 221-226. EXAMPLE The abundance of 12 is A033880(12) = 4, which is a proper divisor of 12, so 12 is in the sequence. MATHEMATICA Select[A005101, MemberQ[Divisors[#], DivisorSigma[1, #] - 2#] &] (* Alonso del Arte, Jul 16 2012 *) PROG (PARI) is_A181595(n)=my(d=sigma(n)-2*n); d>0 & !(n%d) for(n=1, 1e6, is_A181595(n)&print1(n", "))  \\ M. F. Hasler, Apr 14 2012 CROSSREFS Cf. A000396, A005101, A153501, A005820. Sequence in context: A087245 A153501 A215012 * A263189 A263838 A217856 Adjacent sequences:  A181592 A181593 A181594 * A181596 A181597 A181598 KEYWORD nonn AUTHOR Vladimir Shevelev, Nov 01 2010 EXTENSIONS Definition shortened, entries checked by R. J. Mathar, Nov 17 2010 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 17 19:16 EDT 2019. Contains 327137 sequences. (Running on oeis4.)
{"ft_lang_label":"__label__en","ft_lang_prob":0.7178669,"math_prob":0.89482456,"size":3115,"snap":"2019-35-2019-39","text_gpt3_token_len":1165,"char_repetition_ratio":0.10061073,"word_repetition_ratio":0.007352941,"special_character_ratio":0.46998394,"punctuation_ratio":0.21775313,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97613305,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-09-17T23:18:55Z\",\"WARC-Record-ID\":\"<urn:uuid:746b1694-ae94-44b0-a050-3d0e1d925122>\",\"Content-Length\":\"21642\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:dc62f7ae-9663-4cdd-a898-77a5d29029e8>\",\"WARC-Concurrent-To\":\"<urn:uuid:ab39c60e-6d5c-4f0f-ad68-bdf7b6d3bd2b>\",\"WARC-IP-Address\":\"104.239.138.29\",\"WARC-Target-URI\":\"https://oeis.org/A181595\",\"WARC-Payload-Digest\":\"sha1:GZFVLITBRL7X5V5UBKVFB4XO25DZ5TIG\",\"WARC-Block-Digest\":\"sha1:4V3FFU5VZQRPWR3QRIREDBWFAVB4CJOL\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-39/CC-MAIN-2019-39_segments_1568514573124.40_warc_CC-MAIN-20190917223332-20190918005332-00191.warc.gz\"}"}