Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066171
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066171 Numbers n such that d(n) = EulerPhi(n+1) - EulerPhi(n), where d(n) denotes the number of divisors of n. +0
1
6, 74, 315, 344, 5313, 17534, 23655, 27027, 46035, 54494, 56865, 139814 (list; graph; listen)
OFFSET

1,1

COMMENT

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

EXAMPLE

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

MATHEMATICA

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

CROSSREFS

Adjacent sequences: A066168 A066169 A066170 this_sequence A066172 A066173 A066174

Sequence in context: A089926 A135594 A058793 this_sequence A057783 A069852 A049235

KEYWORD

nonn

AUTHOR

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

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 May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research