login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066171 Numbers n such that d(n) = EulerPhi(n+1) - EulerPhi(n), where d(n) denotes the number of divisors of n. 0
6, 74, 315, 344, 5313, 17534, 23655, 27027, 46035, 54494, 56865, 139814, 13437105, 454166115, 2403502647, 4590102525, 38645268615, 96891671331 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

These are the n at which EulerPhi(n) is increasing at a rate equal to d(n).

a(19) > 2*10^11. [From Donovan Johnson (donovan.johnson(AT)yahoo.com), Jun 23 2010]

EXAMPLE

d(74) = 4 = 40 - 36 = EulerPhi(75) - EulerPhi(74).

MATHEMATICA

Select[ Range[ 1, 10^6 ], EulerPhi[ # + 1 ] - EulerPhi[ # ] == DivisorSigma[ 0, # ] & ]

CROSSREFS

Sequence in context: A135594 A168603 A058793 * A057783 A177561 A069852

Adjacent sequences:  A066168 A066169 A066170 * A066172 A066173 A066174

KEYWORD

nonn

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Dec 14 2001

EXTENSIONS

a(13) from Harry J. Smith (hjsmithh(AT)sbcglobal.net), Feb 04 2010

a(14)-a(18) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Jun 23 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 17:48 EST 2012. Contains 205939 sequences.