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!)
A078233 a(1) = 3, a(n+1) = smallest multiple of a(n) using only prime digits(2,3,5,7). 5
3, 27, 2322, 733752, 5327773272, 32322753325273752, 3575237337322577275537537272 (list; graph; refs; listen; history; text; internal format)
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
Sequence in context: A051576 A184278 A158113 * A009039 A137092 A122215
KEYWORD
base,more,nonn
AUTHOR
Amarnath Murthy, Nov 23 2002
EXTENSIONS
More terms from Sascha Kurz, Jan 06 2003
One more term from Fung Cheok Yin (cheokyin_restart(AT)yahoo.com.hk), Sep 02 2006
a(7) from Robert Gerbicz, May 09 2008
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 April 24 10:11 EDT 2024. Contains 371935 sequences. (Running on oeis4.)