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”).
%I #17 Aug 01 2024 09:12:59
%S 1,2,3,4,8,9,28,33,38,808,1642,13288,20434,29001,57374,121858
%N Numbers k with property that k + Fibonacci(k) is prime.
%C Next term > 49000. - _Robert G. Wilson v_, Jun 12 2010
%t fQ[n_] := PrimeQ[ Fibonacci@n + n]; lst = {}; k = 1; While[k < 50001, If[fQ@k, AppendTo[lst, k]; Print@k]; k++ ]; lst (* _Robert G. Wilson v_, Jun 12 2010 *)
%t Select[Range[2000],PrimeQ[#+Fibonacci[#]]&] (* The program generates the first 11 terms of the sequence. *) (* _Harvey P. Dale_, Mar 21 2024 *)
%o (PARI) isok(n) = isprime(n + fibonacci(n)); \\ _Michel Marcus_, Mar 30 2016
%Y Cf. A000045 = Fibonacci(n), A069108 = Primes of the form k + Fibonacci(k).
%K nonn,more
%O 1,2
%A _Zak Seidov_, May 01 2010
%E a(12)-a(14) from _Robert G. Wilson v_, Jun 12 2010
%E a(15)-a(16) from _Michael S. Branicky_, Aug 01 2024