New sequence derived from the totient function

[Max Alekseyev]

On Tue, May 13, 2008 at 4:27 PM, Benoît Jubin <benoit.jubin at gmail.com> wrote:> Dear SeqFans,>>  I'm contemplating adding the following sequence, derived from the>  Euler totient function:>>  a(n) is the least m such that k>=m implies phi(k)>=n
Here are first 100 values of this sequence, computed with my invphi.gp routinehttp://www.cs.ucsd.edu/users/maxal/gpscripts/
? S=Set([1]); print1(1,", "); for(n=2,100, print1(vecmax(eval(S))+1,","); S=setunion(S,Set(invphi(n))) )1, 2, 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, 211, 211,211, 241, 241, 241, 241, 241, 241, 241, 241, 271, 271, 271, 271, 271,271, 271, 271, 331, 331, 331, 331, 331, 331, 331, 331, 331, 331, 331,331, 331, 331, 331, 331, 421, 421, 421, 421
Regards,Max



Benoit,  It is certainly worth submitting - please do so!

Thanks