login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065385 Numbers m at which value of cototient function (A051953) reaches a new record: cototient(m) > cototient(k) for all k < m. 5
1, 2, 4, 6, 10, 12, 18, 24, 30, 36, 42, 48, 54, 60, 66, 72, 78, 84, 90, 102, 108, 114, 120, 126, 132, 138, 144, 150, 168, 180, 198, 204, 210, 240, 252, 264, 270, 294, 300, 330, 360, 378, 390, 420, 450, 462, 480, 504, 510, 540, 546, 570, 600, 630, 660, 690, 714 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

For totient values prime numbers give similar records.

LINKS

Harry J. Smith, Table of n, a(n) for n = 1..1000

FORMULA

a=0; s=0; Do[s=n-EulerPhi[n]; If[s>a, a=s; Print[n]], {n, 1, 10000}]

EXAMPLE

a(8) = 30 because for m = 1...29 the cototient values are all smaller than cototient(30) = 22 = A065386(8) and this is the 8th number at which such a record is reached; analogous sequences are A002093, A002182, A015702 or A005250 for functions other than cototient.

MATHEMATICA

With[{s = Array[# - EulerPhi@ # &, 10^3]}, Map[FirstPosition[s, #][[1]] &, Union@ FoldList[Max, s]]] (* Michael De Vlieger, May 16 2018 *)

PROG

(PARI) r=-1; for(n=1, 1000, d=n-eulerphi(n); if(r<d, r=d; print1(n, ", ")))

(PARI) { n=0; x=-1; for (m=1, 10^9, c=m - eulerphi(m); if (c > x, x=c; write("b065385.txt", n++, " ", m); if (n==1000, return)) ) } \\ Harry J. Smith, Oct 17 2009

CROSSREFS

Cf. A051953, A065386.

Sequence in context: A045958 A076067 A316460 * A244052 A324059 A055235

Adjacent sequences:  A065382 A065383 A065384 * A065386 A065387 A065388

KEYWORD

nonn

AUTHOR

Labos Elemer, Nov 05 2001

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 4 06:07 EDT 2020. Contains 336201 sequences. (Running on oeis4.)