The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A046052 Number of prime factors of Fermat number F(n). 7
 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 4, 5 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,6 COMMENTS F(12) has 6 known factors with C1133 remaining. [Updated by Walter Nissen, Apr 02 2010] F(13) has 4 known factors with C2391 remaining. F(14) has one known factor with C4880 remaining. [Updated by Matt C. Anderson, Feb 14 2010] John Selfridge apparently conjectured that this sequence is not monotonic, so at some point a(n+1) < a(n). Related sequences such as A275377 and A275379 already exhibit such behavior. - Jeppe Stig Nielsen, Jun 08 2018 Factors are counted with multiplicity although it is unknown if all Fermat numbers are squarefree. - Jeppe Stig Nielsen, Jun 09 2018 LINKS PSI (The algorithm company), Fermat factor status [Broken link?] Eric Weisstein's World of Mathematics, Fermat Number Wikipedia, Selfridge's Conjecture about Fermat Numbers FORMULA a(n) = A001222(A000215(n)). PROG (PARI) a(n)=bigomega(2^(2^n)+1) \\ Eric Chen, Jun 13 2018 CROSSREFS Cf. A000215, A023394, A229850. Sequence in context: A168656 A005862 A293254 * A280069 A202276 A029115 Adjacent sequences:  A046049 A046050 A046051 * A046053 A046054 A046055 KEYWORD nonn,more,hard AUTHOR EXTENSIONS Name corrected by Arkadiusz Wesolowski, Oct 31 2011 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 September 30 14:57 EDT 2020. Contains 337439 sequences. (Running on oeis4.)