|
|
A119483
|
|
Smallest m such that m * prime(n) consists of decimal digits not greater than 1.
|
|
1
|
|
|
5, 37, 2, 143, 1, 77, 653, 579, 4787, 37969, 3581, 3, 271, 25607, 213, 1887, 186629, 1641, 16433, 141, 137, 126709, 1217, 123709, 114433, 1, 107767, 934673, 9183579, 8947, 86693, 771, 73, 792159, 739, 7351, 64338223, 6197, 66533, 5843937
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
a(n) is the smallest number m such that the largest digit of m*prime(n) is 1. - Farideh Firoozbakht, Jun 03 2006
|
|
LINKS
|
|
|
EXAMPLE
|
a(1)=37 because 3*37=111.
|
|
MATHEMATICA
|
a[n_]:=(For[m=1, Max[IntegerDigits[m*Prime[n]]]!=1, m++ ]; m); Do[Print[a[n]], {n, 1, 40}] - Farideh Firoozbakht, Jun 03 2006
|
|
PROG
|
(UBASIC)
10 'inspired by Carlos Rivera's Puz361
20 N=19:Y=Y+1:K=0
30 Z=N*Y
40 S=str(Z)
50 A=alen(Z)
60 for X=2 to A+1
70 M=val(mid(S, X, 1))
80 if M>1 then K=K+1
90 next X
100 if K=0 then print Z, N, Y, K:stop
110 Y=Y+1:K=0:goto 30
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|