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!)
 A302098 Number of prime factors (with multiplicity) of generalized Fermat number 14^(2^n) + 1. 1
 2, 1, 2, 3, 2, 4, 2, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS FORMULA a(n) = A001222(A152587(n)). EXAMPLE b(n) = 14^(2^n) + 1 Complete factorizations: b(0) = 3*5 b(1) = 197 b(2) = 41*937 b(3) = 17*5393*16097 b(4) = 193*11284732320255809 b(5) = 7489*1204905857*1667461121*315256811699009 b(6) = 8633886977*P64 b(7) = 257*100497382788383295179961898289105815085380571534081*P95 PROG (PARI) a(n) = bigomega(14^(2^n)+1) CROSSREFS Cf. A275377, A275378, A275379, A275380, A275381, A275382, A275383, A302097, A152587. Sequence in context: A161103 A147301 A108380 * A112779 A029201 A071283 Adjacent sequences:  A302095 A302096 A302097 * A302099 A302100 A302101 KEYWORD nonn,hard,more AUTHOR Jeppe Stig Nielsen, Apr 01 2018 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 8 01:46 EST 2019. Contains 329850 sequences. (Running on oeis4.)