|
Search: id:A076962
|
|
|
| A076962 |
|
Smallest multiple of prime(n) with n divisors, or 0 if no such number exists. |
|
+0
2
|
|
| 0, 3, 25, 14, 14641, 52, 24137569, 114, 2116, 464, 819628286980801, 444, 22563490300366186081, 2752, 35344, 1272, 21559177407076402401757871041, 2196, 740195513856780056217081017732809, 3408, 341056, 80896
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
If p is a prime then a(p) = prime(p)^(p-1). Perhaps no entry is zero for n>1.
|
|
CROSSREFS
|
Cf. A076961.
Adjacent sequences: A076959 A076960 A076961 this_sequence A076963 A076964 A076965
Sequence in context: A080202 A085836 A073916 this_sequence A129599 A042899 A051280
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Oct 21 2002
|
|
EXTENSIONS
|
Corrected and extended by Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Jan 22 2003
|
|
|
Search completed in 0.002 seconds
|
