|
|
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
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|