login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A157333 Least j such that 6*p(j)*M(n)-1 is prime with p(j)=j-th prime and M(n) = Mersenne prime 0
2, 1, 2, 1, 4, 3, 12, 31, 2, 14, 19, 15, 17, 467, 37, 111, 1382, 4830, 276, 1962, 360, 1749, 2857, 17253, 9414, 11974, 30167, 18822, 21387, 24721 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..30.

EXAMPLE

6*3*(2^2-1)-1=53 prime 2^2-1=M(1) 3=p(2) so j(1)=2 6*2*(2^3-1)-1=83 prime 2^3-1=M(2) 2=p(1) so j(2)=1

CROSSREFS

Sequence in context: A088931 A088980 A208548 * A002852 A188440 A216327

Adjacent sequences:  A157330 A157331 A157332 * A157334 A157335 A157336

KEYWORD

nonn

AUTHOR

Pierre CAMI, Feb 27 2009

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified December 22 18:48 EST 2014. Contains 252365 sequences.