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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A139795 Least m such that k>=m implies phi(k)>=n (where phi is the Euler totient function, sequence A000010). 2
 1, 3, 7, 7, 13, 13, 19, 19, 31, 31, 31, 31, 43, 43, 43, 43, 61, 61, 61, 61, 67, 67, 67, 67, 91, 91, 91, 91, 91, 91, 91, 91, 121, 121, 121, 121, 127, 127, 127, 127, 151, 151, 151, 151, 151, 151, 151, 151, 211, 211, 211, 211, 211, 211, 211, 211, 211, 211, 211, 211, 211 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Define b(n)=A006511(m)+1 where m is the unique integer such that A002202(m)=13, then phi(k)>=5, but phi(12)=4. PROG (PARI) {m=0; for(n=1, 100, print1(m+1, ", "); trap(, 0, m=max(m, vecmax(invphi(n)))))} CROSSREFS Different from A137315 (see Comments in that entry). Sequence in context: A227025 A073881 A137315 * A290649 A118259 A060845 Adjacent sequences: A139792 A139793 A139794 * A139796 A139797 A139798 KEYWORD nonn AUTHOR Benoit Jubin, May 21 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.

Last modified January 26 17:44 EST 2023. Contains 359833 sequences. (Running on oeis4.)