login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A119484 Products associated with multipliers in A119483. 1
10, 111, 10, 1001, 11, 1001, 11101, 11001, 110101, 1101101, 111011, 111, 11111, 1101101, 10011, 100011, 11011111, 100101, 1101011, 10011, 10001, 10010011, 101011, 11010101, 11100001, 101, 11100001, 100010011, 1001010111 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(n) is the smallest number of the form m*prime(n) whose largest digit is 1. - Farideh Firoozbakht, Jun 03 2006
LINKS
FORMULA
Find the number which when multiplied by the next prime, produces a product of all 1's and 0's or all 1's.
EXAMPLE
a(1)=111 because 3*37=111.
MATHEMATICA
a[n_]:=(For[m=1, Max[IntegerDigits[m*Prime[n]]]!=1, m++ ]; m*Prime[n]); Do[Print[a[n]], {n, 1, 29}] (* Farideh Firoozbakht, Jun 03 2006 *)
PROG
(UBASIC) 'See A119483
CROSSREFS
Cf. A119483.
Sequence in context: A282679 A086996 A004284 * A281749 A282364 A281895
KEYWORD
easy,nonn
AUTHOR
Enoch Haga, May 23 2006
EXTENSIONS
More terms from Farideh Firoozbakht, Jun 03 2006
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 14 03:52 EDT 2024. Contains 375911 sequences. (Running on oeis4.)