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!)
A070164 Least m such that cototient[m]-1=p[n]. 0

%I #5 Oct 15 2013 22:31:19

%S 9,6,10,12,18,26,34,38,36,42,48,74,82,60,72,78,84,122,134,108,146,152,

%T 164,126,194,202,206,156,150,226,192,180,198,204,222,296,266,260,328,

%U 258,252,338,288,386,270,398,340,392,452,350,342,336,482,372,514,360

%N Least m such that cototient[m]-1=p[n].

%F a[n]=Min[x; A051953(x)-1=n-th prime]

%e p=59=p(17): cototient[{84,100,116,118}]={59} and the smallest is a(17)=84.

%Y Cf. A000010, A051953, A070162.

%K nonn

%O 1,1

%A _Labos Elemer_, Apr 26 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 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)