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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A105555 Let d = number of divisors of n; a(n) = d-th prime. 2
 2, 3, 3, 5, 3, 7, 3, 7, 5, 7, 3, 13, 3, 7, 7, 11, 3, 13, 3, 13, 7, 7, 3, 19, 5, 7, 7, 13, 3, 19, 3, 13, 7, 7, 7, 23, 3, 7, 7, 19, 3, 19, 3, 13, 13, 7, 3, 29, 5, 13, 7, 13, 3, 19, 7, 19, 7, 7, 3, 37, 3, 7, 13, 17, 7, 19, 3, 13, 7, 19, 3, 37, 3, 7, 13, 13, 7, 19, 3, 29, 11, 7, 3, 37, 7, 7, 7, 19, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Antti Karttunen, Table of n, a(n) for n = 1..10000 FORMULA a(n) = A000040(A000005(n)). - Antti Karttunen, May 25 2017 EXAMPLE n = 6 has 4 divisors, prime(4) = 7, so a(6) = 7. MATHEMATICA Prime[DivisorSigma[0, Range[90]]] (* Harvey P. Dale, Jul 27 2011 *) PROG (PARI) d(n) = for(x=1, n, print1(prime(numdiv(x))", ")) (Python) from sympy import prime, divisor_count def a(n): return prime(divisor_count(n)) # Indranil Ghosh, May 25 2017 CROSSREFS Cf. A000005, A000040, A105560, A105561. Sequence in context: A329277 A117531 A275940 * A066858 A333496 A152864 Adjacent sequences:  A105552 A105553 A105554 * A105556 A105557 A105558 KEYWORD easy,nonn AUTHOR Cino Hilliard, May 03 2005 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.

Last modified June 15 12:29 EDT 2021. Contains 345048 sequences. (Running on oeis4.)