login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A074726
Numbers k such that sigma(F(k)) > 2*F(k) where F(k) is the k-th Fibonacci number.
2
12, 18, 24, 30, 36, 40, 42, 48, 54, 60, 72, 80, 84, 90, 96, 108, 120, 126, 132, 140, 144, 150, 156, 160, 162, 168, 180, 192, 198, 200, 204, 210, 216, 225, 228, 234, 240, 252, 264, 270, 276, 280, 288, 294, 300, 306, 312, 315, 320
OFFSET
1,1
COMMENTS
Conjecture: sigma(F(n)) > 2*F(n) if and only if F(n) is a Zumkeller number except for n = 12. Verified for n <= 371. - M. Farrokhi D. G., Aug 16 2020
The asymptotic density of this sequence is larger than 184/1225 = 0.1502... (Wall, 1982). - Amiram Eldar, Feb 05 2022
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..219 (terms 1..156 from T. D. Noe)
Hisanori Mishima, Appendix 1. Factorization results links to internal pages.
Charles R. Wall, Problem H-338, Advanced Problems and Solutions, The Fibonacci Quarterly, Vol. 20, No. 1 (1982), p. 94; Some Abundance, Solution to Problem H-338 by the proposer, ibid., Vol. 21, No. 2 (1983), pp. 159-160.
FORMULA
It seems that a(n) is asymptotic to c*n with 6 < c < 6.5.
MATHEMATICA
Select[ Range[256], DivisorSigma[1, Fibonacci[ #1]] > 2*Fibonacci[ #1] & ]
PROG
(PARI) isok(k) = my(f=fibonacci(k)); sigma(f) > 2*f; \\ Michel Marcus, Feb 05 2022
CROSSREFS
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Sep 04 2002
EXTENSIONS
Edited and extended by Robert G. Wilson v, Sep 06 2002
STATUS
approved