|
| |
|
|
A105555
|
|
Let d = number of divisors of n; a(n) = d-th prime.
|
|
0
| |
|
|
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; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
EXAMPLE
| n = 6 has 4 divisors, prime(4) = 7, so a(6) = 7.
|
|
|
MATHEMATICA
| Prime[DivisorSigma[0, Range[90]]] (* From Harvey P. Dale, Jul 27 2011 *)
|
|
|
PROG
| (PARI) d(n) = for(x=1, n, print1(prime(numdiv(x))", "))
|
|
|
CROSSREFS
| Sequence in context: A140187 A111607 A117531 * A066858 A152864 A152984
Adjacent sequences: A105552 A105553 A105554 * A105556 A105557 A105558
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Cino Hilliard (hillcino368(AT)gmail.com), May 03 2005
|
| |
|
|
