OFFSET
1,1
COMMENTS
This sequence was posed as a puzzle by Prof. E. A. Roganov from Moscow State Industrial University at one of his seminars. It remained unsolved for several years. The solution (cf. current definition) was eventually revealed by the author (communicated by Max Alekseyev on Apr 19 2012).
It may be easily noticed that for an abundant number m, if the sum of its divisors below A033880(m) is smaller than A033880(m), then m is necessarily weird. So A100696 lists those weird numbers that cannot be detected this way. - Max Alekseyev, Apr 19 2012
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Donovan Johnson)
PROG
(PARI) is_A100696(n, d=divisors(n)[^-1], a=vecsum(d)-n, s=a)={for(i=1, #d, d[i]<a||return; (s-=d[i])>0||break); !is_A005835(n, d, a+n)} \\ M. F. Hasler, Jul 30 2016
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, based on email from Alexey Aleksandrov (aleksandrov1988(AT)gmail.com), Mar 28 2006
EXTENSIONS
a(14)-a(30) from Donovan Johnson, Apr 19 2012
Data up to 10^7 double-checked by M. F. Hasler, Jul 30 2016
STATUS
approved