Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A070002
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A070002 Phi[P[n]]-P[Phi[n]] = 1, where P[x]=largest prime factor of x. +0
7
45, 90, 135, 175, 180, 270, 350, 360, 405, 525, 540, 700, 720, 810, 875, 1050, 1080, 1215, 1400, 1440, 1573, 1575, 1620, 1750, 2100, 2160, 2430, 2625, 2800, 2880, 3146, 3150, 3240, 3500, 3645, 4200, 4320, 4375, 4719, 4725, 4860, 5250, 5491, 5600, 5760 (list; graph; listen)
OFFSET

1,1

COMMENT

Phi[P[n]]-P[Phi[n]]=A000010[A006530(n)]- A006530[A000010(n)]=1, where P[x]=largest prime factor of x. Value of commutator of Phi and P functions at n equals -1.

EXAMPLE

m=77077=7.7.11.11.13.13 is here because P[m]=13,Ph[P(13)]=12 Phi[m]=55440=2.2.2.2.3.3.5.7.11 with P(Phi[55440])=13 and the difference is 13-12=1. Large part of but not all terms are divisible with 5.

MATHEMATICA

Do[s=EulerPhi[pf[n]]-pf[EulerPhi[n]]; If[Equal[s, 1], Print[n]], {n, 3, 100000}]

CROSSREFS

Cf. A000010, A006530, A068211, A070777, A070812, A070003, A070004, A007283, A070813-A070816.

Sequence in context: A043964 A140380 A115827 this_sequence A101794 A124017 A121925

Adjacent sequences: A069999 A070000 A070001 this_sequence A070003 A070004 A070005

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), May 07 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 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research