Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078752
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A078752 Least m>n such that phi(m) >= 2*phi(n), where phi is Euler's totient function (A000010). +0
1
3, 3, 5, 5, 11, 7, 13, 11, 13, 11, 23, 13, 29, 17, 17, 17, 37, 19, 37, 23, 29, 23, 47, 25, 41, 29, 37, 29, 59, 31, 61, 37, 41, 37, 53, 37, 73, 41, 53, 41, 83, 43, 89, 47, 53, 47, 97, 49, 89, 53, 67, 53, 107, 55, 83, 59, 73, 59, 127, 61, 127, 67, 73, 67, 97, 67, 137, 71, 89, 71 (list; graph; listen)
OFFSET

1,1

COMMENT

For odd primes p: a(p-1) = p; the converse is not true, as e.g. a(25-1)=25.

CROSSREFS

Sequence in context: A050822 A099536 A082434 this_sequence A124115 A124114 A077893

Adjacent sequences: A078749 A078750 A078751 this_sequence A078753 A078754 A078755

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 22 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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research