|
Search: id:A122098
|
|
|
| A122098 |
|
Smallest number, different from 1, which when multiplied by "n" produce a number with "n" as its rightmost digits. |
|
+0
1
|
|
| 11, 6, 11, 6, 3, 6, 11, 6, 11, 11, 101, 26, 101, 51, 21, 26, 101, 51, 101, 6, 101, 51, 101, 26, 5, 51, 101, 26, 101, 11, 101, 26, 101, 51, 21, 26, 101, 51, 101, 6, 101, 51, 101, 26, 21, 51, 101, 26, 101, 3, 101, 26, 101, 51, 21, 26, 101, 51, 101, 6, 101, 51, 101, 26, 21
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
All prime numbers p > 5 must be multiplied by 1+10^k, where k is the number of digits of p. The result is p U p. - Paolo P. Lava (ppl(AT)spl.at), Apr 11 2008
|
|
EXAMPLE
|
a(8)=6 because 8*6 = 48 and 6 is the minimum number that multiplied by 8 gives a number ending in 8.
a(12)=26 because 12*26=312 and 26 is the minimum number that multiplied by 12 gives a number ending in 12.
|
|
MAPLE
|
P:=proc(n) local a, b, i, j; print(11); for i from 2 by 1 to n do b:=trunc(evalf(log10(i)))+1; for j from 2 by 1 to n do a:=i*j; if i=a-trunc(a/10^b)*10^b then print(j); break; fi; od; od; end: P(101); - Paolo P. Lava (ppl(AT)spl.at), Apr 11 2008
|
|
CROSSREFS
|
Sequence in context: A002547 A090840 A080501 this_sequence A115943 A122088 A038320
Adjacent sequences: A122095 A122096 A122097 this_sequence A122099 A122100 A122101
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Oct 18 2006
|
|
|
Search completed in 0.002 seconds
|
