Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125045
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
19
3, 5, 17, 257, 65537, 641, 7, 318811, 19, 1747, 12791, 73, 90679, 67, 59, 113, 13, 41, 47, 151, 131, 1301297155768795368671, 20921, 1514878040967313829436066877903, 5514151389810781513, 283, 1063, 3027041 (list; graph; listen)
OFFSET

1,1

COMMENT

The first five terms comprise the known Fermat primes: A019434.

LINKS

N. Hobson, Home page (listed in lieu of email address)

EXAMPLE

a(7) = 7 is the smallest prime divisor of 3 * 5 * 17 * 257 *

65537 * 641 + 2 = 2753074036097 = 7 * 11 * 37 * 966329953.

CROSSREFS

Cf. A000945, A019434, A057204-A057208, A051308-A051335, A124984-A124993, A125037-A125045.

Sequence in context: A078726 A019434 A164307 this_sequence A093179 A067387 A050922

Adjacent sequences: A125042 A125043 A125044 this_sequence A125046 A125047 A125048

KEYWORD

nonn

AUTHOR

Nick Hobson Nov 18 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 16 13:01 EST 2009. Contains 170825 sequences.


AT&T Labs Research