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!)
A171137 Smallest number m such that n-th prime = A171135(m). 2

%I #17 Jun 01 2024 11:57:41

%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).

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

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

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

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

%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 (Haskell)

%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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 6 18:47 EDT 2024. Contains 375718 sequences. (Running on oeis4.)