|
| |
|
|
A074697
|
|
Fibonacci(k) has more than k divisors (k such that A000005(A000045(k)) > k).
|
|
1
|
|
|
|
12, 24, 30, 36, 40, 42, 48, 54, 56, 60, 70, 72, 78, 80, 81, 84, 88, 90, 96, 100, 102, 104, 105, 108, 110, 112, 114, 120, 126, 128, 130, 132, 135, 138, 140, 144, 147, 150, 154, 156, 160, 162, 165, 168, 170, 171, 174, 176, 180, 182, 184, 186, 189, 190, 192, 196
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Amiram Eldar, Table of n, a(n) for n = 1..463
|
|
|
MATHEMATICA
|
Select[Range[200], DivisorSigma[0, Fibonacci[#]]>#&] (* Harvey P. Dale, Aug 17 2019 *)
|
|
|
PROG
|
(Python)
from sympy import divisor_count, fibonacci
def ok(n): return divisor_count(fibonacci(n)) > n
print([k for k in range(197) if ok(k)]) # Michael S. Branicky, Dec 24 2021
|
|
|
CROSSREFS
|
Cf. A000005, A000045, A063375.
Sequence in context: A333945 A335146 A182225 * A333919 A289484 A027854
Adjacent sequences: A074694 A074695 A074696 * A074698 A074699 A074700
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Benoit Cloitre, Sep 03 2002
|
|
|
STATUS
|
approved
|
| |
|
|
