login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A132146 Numbers that can't be presented as a sum of a prime number and a Fibonacci number (0 is not considered to be a Fibonacci number). 3

%I #4 Mar 30 2012 18:49:09

%S 1,2,17,29,35,59,83,89,119,125,127,177,179,208,209,221,239,255,269,

%T 287,299,329,331,353,359,363,389,416,419,449,479,485,509,515,519,535,

%U 539,547,551,561,567,569,599,637,659,673,697,705,718,733,739,755,768,779

%N Numbers that can't be presented as a sum of a prime number and a Fibonacci number (0 is not considered to be a Fibonacci number).

%C This sequence contains A132144 as a subsequence and is the complement of A132147.

%H T. D. Noe, <a href="/A132146/b132146.txt">Table of n, a(n) for n=1..10000</a>

%e The smallest prime number is 2, the smallest Fibonacci number is 1; hence 1 and 2 can't be presented as a sum of a prime number and a Fibonacci number.

%t Complement[Range[1000], Take[Union[Flatten[Table[Fibonacci[n] + Prime[k], {n, 700}, {k, 700}]]], 1000]]

%K nonn

%O 1,2

%A _Tanya Khovanova_, Aug 12 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 24 07:54 EDT 2024. Contains 375409 sequences. (Running on oeis4.)