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!)
A071682 Least m such that A060207(m) = n. 1

%I #6 Jun 08 2019 16:26:35

%S 0,1,2,3,4,5,7,10,13,16,20,24,28,32,37,42,47,52,57,62,68,73,79,85,91,

%T 97,103,109,116,122,129,135,142,148,155,162,169,176,183,190,197,204,

%U 211,218

%N Least m such that A060207(m) = n.

%H <a href="http://www.utm.edu/research/primes/howmany.shtml">How Many Primes Are There?</a>

%F a(n) = ceiling(log_2(A007097(n-2))).

%Y Cf. A060207, A007097.

%K more,nonn,less

%O 2,3

%A _David Wasserman_, May 31 2002

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 24 16:34 EDT 2024. Contains 371961 sequences. (Running on oeis4.)