OFFSET
1,1
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
Haskell Program for Abundant and Perfect Numbers [Cached copy at the Wayback Machine].
EXAMPLE
a(1) = 56 because 55 and 57 are composite and the sum of the divisors of 56 is 64 which is >= 56 and no integer < 56 has this property.
MATHEMATICA
Select[Range[800], DivisorSigma[1, #] >= 2 # && And @@ CompositeQ[# + {-1, 1}] &] (* Amiram Eldar, Feb 09 2020 *)
PROG
(PARI) isok(n) = (sigma(n) >= 2*n) && ! isprime(n-1) && ! isprime(n+1) \\ Michel Marcus, Jun 12 2013
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Tony Davie (ad(AT)dcs.st-and.ac.uk)
EXTENSIONS
More terms from Michel Marcus, Jun 12 2013
STATUS
approved