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!)
A078150 Smallest x such that d[phi(x)]-phi[d(x)]=n, where d()=A000005(),phi()=A000010() restricted to cases when d[phi(x)]-phi[d(x)] is positive. 0

%I #6 Oct 15 2013 22:31:44

%S 3,5,7,17,13,35,31,37,113,77,61,221,185,143,211,209,181,287,241,577,

%T 1729,403,421,1297,1057,1001,2113,779,1009,899,1321,1917,5629,1333,

%U 1801,2233,7125,1763,2161,2993,4433,4851,3737,3311,51319,2623,2521

%N Smallest x such that d[phi(x)]-phi[d(x)]=n, where d()=A000005(),phi()=A000010() restricted to cases when d[phi(x)]-phi[d(x)] is positive.

%t f[x_] := DivisorSigma[0, EulerPhi[x]]-EulerPhi[DivisorSigma[0, x]] t=Table[0, {100}]; Do[s=f[n]; If[s<101&&t[[s]]==0, t[[s]]=n], {n, 1, 100000}]; t

%Y Cf. A000005, A000010.

%K easy,nonn

%O 1,1

%A _Labos Elemer_, Nov 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 19 04:35 EDT 2024. Contains 371782 sequences. (Running on oeis4.)