|
Search: id:A085908
|
|
|
| A085908 |
|
Smallest highly composite number beginning with n. |
|
+0
1
|
|
| 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 112, 12, 135, 14, 15, 16, 175, 18, 192, 20, 21, 224, 2304, 24, 25, 2625, 27, 28, 294, 30, 315, 32, 336, 343, 35, 36, 375, 384, 392, 40, 4116, 42, 432, 441, 45, 4608, 4704, 48, 49, 50, 512, 525, 5376, 54, 55125, 56, 576, 588, 59049, 60
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
EXAMPLE
|
a(23)= 2304 = 2^8*3^2 is the smallest highly composite number beginning with 23. ( 23,230,231,232,...,239, 2301,2302,2303 etc. have a divisor > 10.)
|
|
PROGRAM
|
(PARI) hc(n) = local(f); f = factor(n); f[matsize(f)[1], 1] < 10; a(n) = local(d, x); if (hc(n), return(n)); d = 1; while (d, for (i = 1, 10^d - 1, x = n*10^d + i; if (hc(x), return(x))); d++); (Wasserman)
|
|
CROSSREFS
|
Adjacent sequences: A085905 A085906 A085907 this_sequence A085909 A085910 A085911
Sequence in context: A055649 A111705 A071274 this_sequence A110304 A043315 A044912
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 09 2003
|
|
EXTENSIONS
|
Corrected and extended by David Wasserman (wasserma(AT)spawar.navy.mil), Feb 11 2005
|
|
|
Search completed in 0.002 seconds
|
