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!)
A075868 tau(n) = phi(sum of prime factors of n). 0
3, 6, 15, 20, 21, 28, 35, 50, 66, 98, 99, 104, 105, 114, 125, 130, 154, 170, 210, 230, 276, 325, 351, 352, 363, 372, 374, 380, 414, 444, 459, 476, 532, 539, 558, 572, 580, 585, 608, 666, 693, 696, 845, 847, 950, 968, 975 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,1
LINKS
EXAMPLE
tau(50) = number of divisors of 50 = 6; phi(sum of prime factors of 50) = phi(2 + 5) = 6. Hence 50 is a term of the sequence.
MATHEMATICA
Select[Range[2, 10^3], EulerPhi[Apply[Plus, Transpose[FactorInteger[ # ]][[1]]]] == DivisorSigma[0, # ] &]
CROSSREFS
Sequence in context: A265486 A060304 A342555 * A162335 A289296 A310126
KEYWORD
nonn
AUTHOR
Joseph L. Pe, Oct 15 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 May 1 23:54 EDT 2024. Contains 372178 sequences. (Running on oeis4.)