The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A077350 Smallest number beginning with n and having exactly n divisors. 1
 1, 2, 361, 46, 519885601, 63, 729, 88, 9025, 1053, 110462212541120451001, 126, 13841287201, 1458, 15376, 168, 1771091617586207101953855861006509233214261761, 180, 19267699140703639475173287301067237020969, 2000, 210681, 228352, 2384185791015625, 2430, 25091827216, 2625536, 27225, 28480 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Next (29th) term is 1039^28 and contains 85 digits. - Max Alekseyev, Feb 10 2005 LINKS EXAMPLE a(6) = 63 = 3^2*7 has six divisors 1,3,7,9,21 and 63. PROG (PARI) { len10(n) = ceil(log(n+1)/log(10)); } { A077350(n) = if(isprime(n), forprime(i=2, 10^5, m=i^(n-1); if(m\10^(len10(m)-len10(n))==n, return(m))), for(d=0, 20, for(i=0, 10^d-1, m=n*10^d+i; if(numdiv(m)==n, return(m)))) ); return(0); } \\ Max Alekseyev CROSSREFS Sequence in context: A230688 A325629 A062381 * A013506 A013512 A295174 Adjacent sequences:  A077347 A077348 A077349 * A077351 A077352 A077353 KEYWORD base,nonn AUTHOR Amarnath Murthy, Nov 05 2002 EXTENSIONS Corrected and extended by Max Alekseyev, Feb 10 2005 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 5 23:38 EST 2021. Contains 349558 sequences. (Running on oeis4.)