This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A063487 Number of distinct prime divisors of 2^(2^n)-1 (A051179). 0
 0, 1, 2, 3, 4, 5, 7, 9, 11, 13, 16, 20, 25 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS 2^(2^n)-1 is the product of the first n Fermat numbers F(0),...,F(n-1) (A000215). Hence this sequence is just the summation of A046052, which gives the number of prime factors in each Fermat number. - T. D. Noe, Jan 07 2003 REFERENCES D. M. Burton, Elementary Number Theory, Allyn and Bacon Inc., Boston MA, 1976, p. 238. LINKS Eric Weisstein's World of Mathematics, Fermat Number PROG (PARI) for(n=0, 22, print(omega(2^(2^n)-1))) CROSSREFS Cf. A051179, A000215, A046052. Sequence in context: A158923 A008740 A089651 * A253063 A081998 A325266 Adjacent sequences:  A063484 A063485 A063486 * A063488 A063489 A063490 KEYWORD nonn AUTHOR Jason Earls, Jul 28 2001 EXTENSIONS More terms from T. D. Noe, Jan 07 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 December 7 18:12 EST 2019. Contains 329847 sequences. (Running on oeis4.)