|
%I #13 Dec 15 2017 17:37:07
%S 1,35,119,125,177,208,209,221,255,287,299,329,363,416,485,515,519,535,
%T 539,551,561,567,637,697,705,718,755,768,779,784,793,815,869,875,899,
%U 925,926,933,935,951,995,1037,1045,1075,1079,1107,1139,1145,1147,1149
%N Numbers that can't be expressed as the sum of a prime number and a Fibonacci number (0 is considered to be a Fibonacci number).
%C This sequence is a subsequence of A132146 and the complement of A132145.
%D J. Earls, "Fibonacci Prime Decompositions," Mathematical Bliss, Pleroma Publications, 2009, pages 76-79. ASIN: B002ACVZ6O [From _Jason Earls_, Nov 24 2009]
%H T. D. Noe, <a href="/A132144/b132144.txt">Table of n, a(n) for n=1..10000</a>
%H Lenny Jones, <a href="http://www.emis.de/journals/INTEGERS/papers/m11/m11.Abstract.html">Fibonacci variations of a conjecture of Polignac</a>, Integers, 12 (2012), A11.
%e The smallest prime number is 2, the smallest Fibonacci number is 0; hence 1 can't be presented as a sum of a prime number and a Fibonacci number.
%t nn = 17; f = Union[Fibonacci[Range[0, nn]]]; p = Prime[Range[PrimePi[f[[-1]]]]]; fp = Select[Union[Flatten[Outer[Plus, f, p]]], # < f[[-1]] &]; Complement[Range[f[[-1]] - 1], fp] (* _T. D. Noe_, Mar 06 2012 *)
%K nonn
%O 1,2
%A _Tanya Khovanova_, Aug 12 2007
|
