OFFSET
1,2
COMMENTS
This sequence contains all prime numbers as a subsequence because 1 is a Fibonacci number. Similarly it contains all even semiprimes.
LINKS
G. C. Greubel, Table of n, a(n) for n = 1..5000
EXAMPLE
8 is not in this sequence because the only way to represent 8 as a product of a prime and some number is 2*4 and 4 is not a Fibonacci number.
105 is in this sequence because 105 = 3*21 and 3 is a prime number and 21 is a Fibonacci number.
MATHEMATICA
Take[Union[Flatten[Table[Fibonacci[n]*Prime[k], {n, 70}, {k, 70}]]], 70]
PROG
(PARI) isfib(n) = my(k=n^2); k+=(k+1)<<2; issquare(k) || (n>0 && issquare(k-8));
isok(n) = {if (n==0, return (1)); my(f=factor(n)); for (k=1, #f~, p = f[k, 1]; if (isfib(n/p), return (1)); ); } \\ Michel Marcus, Apr 19 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
Tanya Khovanova, Aug 14 2007
STATUS
approved
