The On-Line Encyclopedia of Integer Sequences (OEIS)

The OEIS is supported by the many generous donors to the OEIS Foundation.

Revision History for A069797

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A069797

Smallest k>n such that phi(n) divides phi(k).
(history; published version)

#11 by Harvey P. Dale at Tue Jun 14 17:14:45 EDT 2022

STATUS

editing

approved

#10 by Harvey P. Dale at Tue Jun 14 17:14:43 EDT 2022

MATHEMATICA

sk[n_]:=Module[{p1=EulerPhi[n], k=n+1}, While[Mod[EulerPhi[k], p1]!=0, k++]; k]; Array[sk, 70] (* Harvey P. Dale, Jun 14 2022 *)

STATUS

approved

editing

#9 by Charles R Greathouse IV at Sat Apr 30 17:52:55 EDT 2016

STATUS

proposed

approved

#8 by Ivan Neretin at Sat Apr 30 17:33:15 EDT 2016

STATUS

editing

proposed

#7 by Ivan Neretin at Sat Apr 30 17:33:00 EDT 2016

LINKS

Ivan Neretin, <a href="/A069797/b069797.txt">Table of n, a(n) for n = 1..10000</a>

STATUS

approved

editing

#6 by Russ Cox at Fri Mar 30 18:38:57 EDT 2012

AUTHOR

_Benoit Cloitre (benoit7848c(AT)orange.fr), _, May 01 2002

Discussion

Fri Mar 30

18:38

OEIS Server: https://oeis.org/edit/global/216

#5 by N. J. A. Sloane at Sun Jun 29 03:00:00 EDT 2008

KEYWORD

easy,nonn,new

AUTHOR

Benoit Cloitre (abmtbenoit7848c(AT)wanadooorange.fr), May 01 2002

#4 by N. J. A. Sloane at Wed Sep 21 03:00:00 EDT 2005

KEYWORD

easy,nonn,new

AUTHOR

Benoit Cloitre (abcloitreabmt(AT)modulonetwanadoo.fr), May 01 2002

#3 by N. J. A. Sloane at Tue Jul 19 03:00:00 EDT 2005

KEYWORD

easy,nonn,new

AUTHOR

Benoit Cloitre (abcloitre(AT)wanadoomodulonet.fr), May 01 2002

#2 by N. J. A. Sloane at Thu Feb 19 03:00:00 EST 2004

PROG

(PARI) for(s=1, 80, n=s+1; while(frac(eulerphi(n)/eulerphi(s))>0, n++); print1(n, ", "); )

KEYWORD

easy,nonn,new