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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A171137 Smallest number m such that n-th prime = A171135(m). 2

%I #9 Oct 23 2014 09:26:07

%S 1,3,21,120,884,1199,1736,5801,12757,17651,16136,33461,98009,109754,

%T 462331,376523,72206,410384,368531,1399904,1991081,2063819,1803503,

%U 7056937,3909176,9747886,10941734,24616054

%N Smallest number m such that n-th prime = A171135(m).

%C a(n) = MIN(m: A171135(m)=A000040(n));

%C A171135(a(n)) = A000040(n);

%C A171136(a(n)) = A000040(n) + 2*a(n).

%H Charles R Greathouse IV, <a href="/A171137/b171137.txt">Table of n, a(n) for n = 1..48</a>

%o (PARI) A171135(n)=forprime(p=2, , if(bigomega(p+2*n)<3, return(p)))

%o a(n)=my(p=prime(n), m); while(bigomega(p+2*m++)>2 || A171135(m)!=p, ); m \\ _Charles R Greathouse IV_, Oct 21 2014

%o a171137 n = head [m | m <- [1..], a171135 m == a000040 n]

%o -- _Reinhard Zumkeller_, Oct 21 2014

%K nonn

%O 1,2

%A _Reinhard Zumkeller_, Dec 04 2009

%E Definition corrected; thanks to Harvey P. Dale, who pointed out the mistake. - _Reinhard Zumkeller_, Oct 21 2014

%E a(20)-a(28) from _Charles R Greathouse IV_, Oct 21 2014

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.

Last modified December 7 05:34 EST 2023. Contains 367630 sequences. (Running on oeis4.)