login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A063080 n/d(n) is prime, where d(n) is the number of divisors of n. 1
8, 9, 12, 18, 24, 40, 56, 60, 84, 88, 104, 132, 136, 152, 156, 184, 204, 228, 232, 248, 276, 296, 328, 344, 348, 372, 376, 424, 444, 472, 488, 492, 516, 536, 564, 568, 584, 632, 636, 664, 708, 712, 732, 776, 804, 808, 824, 852, 856, 872, 876, 904, 948, 996 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,1000

EXAMPLE

n=18: 18/d(18) = 3 a prime.

PROG

(PARI) j=[]; for(n=1, 3000, if(Mod(n, numdiv(n))==0, if(isprime((n/numdiv(n))), j=concat(j, n)))); j

(PARI) { n=0; for (m=1, 10^9, if(m%(d=numdiv(m))==0 && isprime(m/d), write("b063080.txt", n++, " ", m); if (n==1000, break)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 17 2009]

CROSSREFS

Cf. A000005, A039819, A036762, A051278, A051279, A051280, A036763, A033950.

Sequence in context: A179443 A080756 A189833 * A167131 A109079 A050883

Adjacent sequences:  A063077 A063078 A063079 * A063081 A063082 A063083

KEYWORD

easy,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Aug 05 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 18:47 EST 2012. Contains 205663 sequences.