Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A075868
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A075868 tau(n) = phi(sum of prime factors of n). +0
1
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; listen)
OFFSET

2,1

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: A124518 A160724 A060304 this_sequence A162335 A095869 A069559

Adjacent sequences: A075865 A075866 A075867 this_sequence A075869 A075870 A075871

KEYWORD

nonn

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Oct 15 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 November 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research