The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A146525 a(n) is the largest nonnegative integer m such that 2*n*k-1 is prime for all k where 1<=k<=m. a(n) = 0 if 2n-1 is composite. 1
0, 3, 5, 1, 0, 2, 1, 0, 1, 1, 0, 3, 0, 0, 3, 1, 0, 0, 1, 0, 2, 1, 0, 1, 0, 0, 2, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 3, 0, 0, 5, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 2, 0, 0, 0, 0, 0, 0, 1, 0, 2, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 3, 0, 0, 2, 1, 0, 0, 0, 0, 2, 1, 0, 1, 1, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
EXAMPLE
For n = 3: 2*3*1 -1 = 5, which is prime. 2*3*2 - 1 = 11, which is prime. 2*3*3 - 1 = 17, which is prime. 2*3*4 -1 = 23, which is prime. 2*3*5 -1 = 29, which is prime. But 2*3*6 - 1 = 35, which is composite. So a(3) = 5, because there are 5 primes in the arithmetic sequence before hitting a composite.
CROSSREFS
Sequence in context: A113039 A093016 A031018 * A196611 A011353 A016452
KEYWORD
nonn
AUTHOR
Leroy Quet, Oct 30 2008
EXTENSIONS
Extended by Ray Chandler, Nov 01 2008
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 June 13 17:32 EDT 2024. Contains 373391 sequences. (Running on oeis4.)