Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A105555
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A105555 Let d = number of divisors of n; a(n) = d-th prime. +0
1
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; listen)
OFFSET

1,1

EXAMPLE

n = 6 has 4 divisors, prime(4) = 7, so a(6) = 7.

PROGRAM

(PARI) d(n) = for(x=1, n, print1(prime(numdiv(x))", "))

CROSSREFS

Sequence in context: A140187 A111607 A117531 this_sequence A066858 A152864 A152984

Adjacent sequences: A105552 A105553 A105554 this_sequence A105556 A105557 A105558

KEYWORD

easy,nonn

AUTHOR

Cino Hilliard (hillcino368(AT)gmail.com), May 03 2005

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 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research