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
3, 5, 7, 17, 13, 35, 31, 37, 113, 77, 61, 221, 185, 143, 211, 209, 181, 287, 241, 577, 1729, 403, 421, 1297, 1057, 1001, 2113, 779, 1009, 899, 1321, 1917, 5629, 1333, 1801, 2233, 7125, 1763, 2161, 2993, 4433, 4851, 3737, 3311, 51319, 2623, 2521 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
MATHEMATICA
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
CROSSREFS
Sequence in context: A099863 A112092 A031441 * A276044 A114265 A258195
KEYWORD
easy,nonn
AUTHOR
Labos Elemer, Nov 26 2002
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 05:16 EDT 2024. Contains 371906 sequences. (Running on oeis4.)