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”).

A063248
Smallest composite number in base n which contains its largest proper factor as a substring.
0
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
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: A068708 A370610 A367451 * A027522 A330580 A254959
KEYWORD
base,nonn
AUTHOR
Robert G. Wilson v, Aug 08 2001
EXTENSIONS
More terms from Dean Hickerson, Aug 10, 2001
STATUS
approved