This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A080307 Multiples of the Fermat numbers 2^(2^n)+1. 2
 3, 5, 6, 9, 10, 12, 15, 17, 18, 20, 21, 24, 25, 27, 30, 33, 34, 35, 36, 39, 40, 42, 45, 48, 50, 51, 54, 55, 57, 60, 63, 65, 66, 68, 69, 70, 72, 75, 78, 80, 81, 84, 85, 87, 90, 93, 95, 96, 99, 100, 102, 105, 108, 110, 111, 114, 115, 117, 119, 120, 123, 125, 126, 129, 130, 132 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Since all the Fermat numbers are relatively prime to each other (see link), the probability that a given integer is not a multiple of the first k Fermat numbers is 2^((2^k)-1) / 2^(2^k)-1, the limit of which is .5 as k increases infinitely; therefore the probability that an integer is a Fermat multiple, as well as the probability that it is not, is .5. LINKS R. Munafo, Notes on Fermat numbers CROSSREFS Cf. A000215, A080308, A080309. Sequence in context: A237417 A165740 A241571 * A001969 A075311 A032786 Adjacent sequences:  A080304 A080305 A080306 * A080308 A080309 A080310 KEYWORD easy,nonn AUTHOR Matthew Vandermast, Feb 16 2003 STATUS approved

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

Last modified October 20 07:23 EDT 2019. Contains 328252 sequences. (Running on oeis4.)