Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078150
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
1
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; listen)
OFFSET

1,1

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

Cf. A000005, A000010.

Sequence in context: A099863 A112092 A031441 this_sequence A114265 A110358 A038971

Adjacent sequences: A078147 A078148 A078149 this_sequence A078151 A078152 A078153

KEYWORD

easy,nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Nov 26 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 5 23:38 EST 2009. Contains 170428 sequences.


AT&T Labs Research