login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A077073 a(1) = 2, a(n+1) is smallest prime factor of (2 * Product_{k=1..n} a(k)) + 1. 0
2, 5, 3, 61, 7, 25621, 656410021, 8874301, 9137, 1069, 491, 23, 1031, 17, 19, 41, 197, 311, 1187, 113, 11, 1249, 650176342761734684441179196492094381946145205110026217821, 13, 43, 89, 239, 56359, 31732153, 29, 37, 9109, 907, 6323, 293, 811, 77806657 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Variation of the Euclid-Mullin sequence A000945.
LINKS
EXAMPLE
a(5) is equal to 7 because 2*(2*5*3*61)+1 = 3661 = 7 * 523.
CROSSREFS
Cf. A000945.
Sequence in context: A308949 A109734 A239309 * A307126 A191474 A199602
KEYWORD
nonn
AUTHOR
Jason Earls, Nov 29 2002
EXTENSIONS
a(26)-a(37) from Robert Price, Jul 20 2015
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 08:27 EDT 2024. Contains 371964 sequences. (Running on oeis4.)