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!)
A145747 a(n) is the smallest number m such that phi(m)+sigma(m)=n*pi(m). 0

%I #2 Mar 30 2012 17:37:44

%S 3,2,14,26,55,30,56,329,626,366,340,558,288,552,828,3496,6928,2430,

%T 81809,3920,3432,8680,48380,23430,2520,144020,435056,21384,728096,

%U 188376,11802175,97320,54057938,89700,349752,1143492,11286632,490752

%N a(n) is the smallest number m such that phi(m)+sigma(m)=n*pi(m).

%C a(47) is greater than 4*10^8.

%t a[n_]:=(For[m=1,DivisorSigma[1,m]+EulerPhi[m]!=n EulerPhi[m],m++ ];m);Do[Print[a[n]],{n,3,46}]

%Y Cf. A015704.

%K nonn

%O 3,1

%A _Farideh Firoozbakht_, Oct 30 2008

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 May 4 19:41 EDT 2024. Contains 372257 sequences. (Running on oeis4.)