Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069797
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069797 Smallest k>n such that phi(n) divides phi(k). +0
1
2, 3, 4, 5, 8, 7, 9, 10, 13, 12, 22, 13, 21, 18, 16, 17, 32, 19, 27, 24, 26, 25, 46, 30, 33, 28, 37, 35, 58, 32, 61, 34, 41, 40, 39, 37, 57, 54, 45, 48, 55, 45, 49, 50, 52, 67, 94, 51, 86, 55, 64, 56, 106, 57, 75, 65, 63, 87, 118, 64, 77, 77, 73, 68, 97, 75, 134, 80, 89, 72 (list; graph; listen)
OFFSET

1,1

PROGRAM

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

CROSSREFS

Sequence in context: A094607 A098098 A080785 this_sequence A091893 A074756 A075162

Adjacent sequences: A069794 A069795 A069796 this_sequence A069798 A069799 A069800

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), May 01 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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research