OFFSET
1,1
COMMENTS
Agrees for a long time with sequence of Fibonacci numbers whose number of divisors is a Fibonacci number.
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..575 (terms 1..100 from T. D. Noe)
FORMULA
Fibonacci(n) such that mu(Fibonacci(n)) = -1, where mu(n) is the Moebius mu function (A008683).
EXAMPLE
610 belongs to the sequence because it has 3 prime factors (2, 5, 61); it also has 8 divisors (1, 2, 5, 10, 61, 122, 305, 610).
MAPLE
with(combinat, fibonacci): m2_fib := proc(n); if (numtheory[mobius](fibonacci(n))=-1) then RETURN(fibonacci(n)); fi; end: seq(m2_fib(i), i=1..100);
MATHEMATICA
Select[Fibonacci[Range[80]], MoebiusMu[#] == -1 &] (* Harvey P. Dale, Aug 23 2011 *)
CROSSREFS
KEYWORD
easy,nice,nonn
AUTHOR
Felice Russo, Sep 03 2002
EXTENSIONS
More terms from Jani Melik, Oct 07 2002
STATUS
approved