|
Search: id:A078238
|
|
|
| A078238 |
|
a(1) = 9, a(n+1) = smallest multiple of a(n) using only composite digits (4,6,8,9,0) and is not divisible by 10. |
|
+0
3
|
|
| 9, 99, 9009, 99099, 44990946, 494900406, 4688686446444, 404989980498046944, 44090684496040044064666464, 88060080898094990484996406446844608
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Sequence is infinite: the concatenation of two a(n)'s is an upper bound for a(n+1). - Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Jan 04 2003
|
|
CROSSREFS
|
Cf. A078236, A078237.
Adjacent sequences: A078235 A078236 A078237 this_sequence A078239 A078240 A078241
Sequence in context: A070068 A068668 A035027 this_sequence A080494 A077710 A088780
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Nov 23 2002
|
|
EXTENSIONS
|
a(9) from Robert Gerbicz (robert.gerbicz(AT)gmail.com), May 09 2008
a(10) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Sep 05 2008
|
|
|
Search completed in 0.002 seconds
|
