login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A121858
Smallest odd number having prime(n) divisors, where prime(n) is the n-th prime=A000040(n).
1
3, 9, 81, 729, 59049, 531441, 43046721, 387420489, 31381059609, 22876792454961, 205891132094649, 150094635296999121, 12157665459056928801, 109418989131512359209, 8862938119652501095929, 6461081889226673298932241
OFFSET
1,1
COMMENTS
a(n) is also the smallest number k with the property that the symmetric representation of sigma(k) has prime(n) subparts. - Omar E. Pol, Oct 08 2022
FORMULA
a(n) = 3^(prime(n)-1) = 3^A006093(n).
a(n) = A038547(A000040(n)). - Omar E. Pol, Oct 08 2022
MATHEMATICA
3^(Prime[Range[20]]-1) (* Harvey P. Dale, Mar 19 2013 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Lekraj Beedassy, Aug 30 2006
STATUS
approved