OFFSET
1,2
COMMENTS
Or, numbers n such that sigma(n) = k*n + d(n) for some k.
For most terms > 4, sigma(n) = 2*n + d(n), i.e., k=2. However, for the 12th term, k=3.
If p = 2^m-(2m+1) is prime and n = 2^(m-1)*p then sigma(n) = 2*n+d(n), i.e., k=2 and n is in the sequence. 56, 7232, 30592, 36028789368553472, 9223371897268338688 and 29230032746618058364071726105239688547563879792624 are such terms of the sequence. - Farideh Firoozbakht, Aug 19 2013
a(16) > 8*10^12. - Giovanni Resta, Nov 07 2019
LINKS
Farideh Firoozbakht and M. F. Hasler, Variations on Euclid's formula for perfect numbers, Journal of Integer Sequences 13.3 (2010), 18 pp. Article ID 10.3.1.
FORMULA
Numbers n such that A000203(n) (mod n) == A000005(n) or A054024(n)=A000005(n). - Labos Elemer, Apr 12 2002
MATHEMATICA
Do[If[Mod[DivisorSigma[1, n]-DivisorSigma[0, n], n]==0, Print[n]], {n, 1, 10^8}]
PROG
(PARI) is(n)=my(f=factor(n)); (sigma(f)-numdiv(f))%n==0 \\ Charles R Greathouse IV, Nov 04 2016
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Robert G. Wilson v, Jul 26 2000
EXTENSIONS
a(15) from Giovanni Resta, Nov 07 2019
STATUS
approved