Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A070800
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A070800 Smallest prime greater than EulerPhi of n: a(n)=nextprime[phi(n)]. +0
5
2, 3, 3, 5, 3, 7, 5, 7, 5, 11, 5, 13, 7, 11, 11, 17, 7, 19, 11, 13, 11, 23, 11, 23, 13, 19, 13, 29, 11, 31, 17, 23, 17, 29, 13, 37, 19, 29, 17, 41, 13, 43, 23, 29, 23, 47, 17, 43, 23, 37, 29, 53, 19, 41, 29, 37, 29, 59, 17, 61, 31, 37, 37, 53, 23, 67, 37, 47, 29, 71, 29, 73, 37 (list; graph; listen)
OFFSET

2,1

FORMULA

a(n)=p[1+Pi(phi[n])]=A007918[A000010(n)]

MATHEMATICA

Table[Prime[1+PrimePi[EulerPhi[w]]], {w, 2, 128}]

CROSSREFS

Cf. A007918, A000010, A070801.

Sequence in context: A064917 A154727 A065070 this_sequence A138663 A056149 A167494

Adjacent sequences: A070797 A070798 A070799 this_sequence A070801 A070802 A070803

KEYWORD

easy,nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), May 08 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research