|
|
A078233
|
|
a(1) = 3, a(n+1) = smallest multiple of a(n) using only prime digits(2,3,5,7).
|
|
5
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The sequence is infinite. Proof by contradiction: Assume a(n) is the last term of the sequence. If m is an integer such that 10^{m-1} +1 < a(n) < 10^m +1 then a(n) * (10^m +1) is a multiple of a(n) using only prime digits. - Fung Cheok Yin (cheokyin_restart(AT)yahoo.com.hk), Sep 02 2006
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,more,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
One more term from Fung Cheok Yin (cheokyin_restart(AT)yahoo.com.hk), Sep 02 2006
|
|
STATUS
|
approved
|
|
|
|