|
Search: id:A119484
|
|
| |
|
| 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; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(n) is the smallest number of the form m*prime(n) such that its largest digit is 1. - Farideh Firoozbakht (mymontain(AT)yahoo.com), Jun 03 2006
|
|
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 (mymontain(AT)yahoo.com), Jun 03 2006
|
|
PROGRAM
|
UBASIC (see A119483)
|
|
CROSSREFS
|
Cf. A119483.
Sequence in context: A092501 A086996 A004284 this_sequence A100751 A004290 A105991
Adjacent sequences: A119481 A119482 A119483 this_sequence A119485 A119486 A119487
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Enoch Haga (Enokh(AT)comcast.net), May 23 2006
|
|
EXTENSIONS
|
More terms from Farideh Firoozbakht (mymontain(AT)yahoo.com), Jun 03 2006
|
|
|
Search completed in 0.002 seconds
|
