%I A125045
%S A125045 3,5,17,257,65537,641,7,318811,19,1747,12791,73,90679,67,59,113,13,41,
%T A125045 47,151,131,1301297155768795368671,20921,
%U A125045 1514878040967313829436066877903,5514151389810781513,283,1063,3027041
%N A125045 Odd primes generated recursively. Initial prime is 3. General term is 
               a(n)=Min {p is prime; p divides Q+2}, where Q is the product of previous 
               terms in the sequence.
%C A125045 The first five terms comprise the known Fermat primes: A019434.
%H A125045 N. Hobson, <a href="http://www.qbyte.org/puzzles/">Home page (listed 
               in lieu of email address)</a>
%e A125045 a(7) = 7 is the smallest prime divisor of 3 * 5 * 17 * 257 *
%e A125045 65537 * 641 + 2 = 2753074036097 = 7 * 11 * 37 * 966329953.
%Y A125045 Cf. A000945, A019434, A057204-A057208, A051308-A051335, A124984-A124993, 
               A125037-A125045.
%Y A125045 Sequence in context: A078726 A019434 A164307 this_sequence A093179 A067387 
               A050922
%Y A125045 Adjacent sequences: A125042 A125043 A125044 this_sequence A125046 A125047 
               A125048
%K A125045 nonn
%O A125045 1,1
%A A125045 Nick Hobson Nov 18 2006