|
| |
|
|
A074698
|
|
Numbers n such that n divides the number of divisors of F(n), the n-th Fibonacci number.
|
|
0
| | |
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Are all numbers of the form 2^k*24, 2^k*64 k>=0, in the sequence ?
|
|
|
MAPLE
| with(combinat): with(numtheory): a:=proc(n) if type(tau(fibonacci(n))/n, integer)=true then n else fi end: seq(a(n), n=1..200); (Deutsch)
|
|
|
CROSSREFS
| Sequence in context: A105651 A105779 A199105 * A050497 A162282 A008606
Adjacent sequences: A074695 A074696 A074697 * A074699 A074700 A074701
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 03 2002
|
|
|
EXTENSIONS
| 256 from Emeric Deutsch (deutsch(AT)duke.poly.edu), Jan 30 2006
|
| |
|
|
