|
Search: id:A063248
|
|
|
| A063248 |
|
Smallest composite number in base n which contains its largest proper factor as a substring. |
|
+0
2
|
|
| 4, 9, 407, 25, 9, 49, 893, 1387, 15, 121, 23533, 169, 21, 4717, 10579, 289, 27, 361, 25, 49, 33, 529, 32437, 61903, 39, 24523, 35, 841, 45, 961, 39917, 77, 51, 64993, 111277, 1369, 57, 91, 99101, 1681, 49, 1849, 55, 108389, 69, 2209, 207133, 139163
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
MATHEMATICA
|
sublist[ s_, l_ ] := Module[ {i, ls=Length[ s ]}, For[ i=1, i+ls-1<=Length[ l ], i++, If[ s==Take[ l, {i, i+ls-1} ], Return[ True ] ] ]; False ]; a[ n_ ] := Module[ {k}, For[ k=4, True, k++, If[ !PrimeQ[ k ]&&sublist[ IntegerDigits[ Divisors[ k ][ [ -2 ] ], n ], IntegerDigits[ k, n ] ], Return[ k ] ] ] ];
|
|
CROSSREFS
|
Cf. A062238.
Sequence in context: A029734 A085065 A068708 this_sequence A027522 A028869 A073172
Adjacent sequences: A063245 A063246 A063247 this_sequence A063249 A063250 A063251
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 08 2001
|
|
EXTENSIONS
|
More terms from Dean Hickerson, Aug 10, 2001
|
|
|
Search completed in 0.002 seconds
|
