login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

Table of n, a(n) for n=1..40.

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

120 'neils361, Enoch Haga, May 20 2006

CROSSREFS

Cf. A119484, A007088.

Sequence in context: A002666 A222592 A174507 * A157809 A079339 A257343

Adjacent sequences:  A119480 A119481 A119482 * A119484 A119485 A119486

KEYWORD

nonn,base

AUTHOR

Enoch Haga, May 23 2006

EXTENSIONS

Edited by Charles R Greathouse IV, Aug 05 2010

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 23 19:07 EDT 2019. Contains 323528 sequences. (Running on oeis4.)