|
Search: id:A105582
|
|
|
| A105582 |
|
Smallest composite number n such that every divisor > 1 includes n as a substring. |
|
+0
1
|
|
| 10201, 121, 254, 39, 1849, 25, 16043, 497, 6889, 1691, 10201, 111221, 16129, 13169, 214411, 1532801, 516221, 117589, 1401847, 19361, 2520899, 44521, 512231, 235129, 582497, 628253, 726031, 395279, 802817, 295639, 921307, 31961, 4320991, 143323
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
All entries so far are semiprimes (A001358), some are perfect powers (A001597). - Robert G. Wilson v (rgwv(AT)rgwv.com), May 09 2005
|
|
MATHEMATICA
|
fQ[n_, i_] := Block[{d = ToString /@ Drop[ Divisors[n], 1]}, Union[ StringPosition[d, ToString[i]]][[1]] != {}]; Do[k = 2; While[ PrimeQ[k] || fQ[k, n] == False, k++ ]; Print[k], {n, 0, 31}] (from Robert G. Wilson v (rgwv(AT)rgwv.com), May 09 2005)
|
|
CROSSREFS
|
Sequence in context: A128878 A050267 A102326 this_sequence A100968 A031987 A074671
Adjacent sequences: A105579 A105580 A105581 this_sequence A105583 A105584 A105585
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
David W. Wilson (davidwwilson(AT)comcast.net), May 08 2005
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), May 09 2005
|
|
|
Search completed in 0.002 seconds
|
