login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A174813 a(n) = number whose product of digits equals a power of 3. 10
1, 3, 9, 11, 13, 19, 31, 33, 39, 91, 93, 99, 111, 113, 119, 131, 133, 139, 191, 193, 199, 311, 313, 319, 331, 333, 339, 391, 393, 399, 911, 913, 919, 931, 933, 939, 991, 993, 999, 1111, 1113, 1119, 1131, 1133, 1139, 1191, 1193, 1199, 1311, 1313, 1319, 1331 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Equivalently, numbers whose decimal representation consists of digits from the set {1,3,9}.
LINKS
EXAMPLE
a(9)=39 is in the sequence because 3*9=3^3.
MATHEMATICA
Select[Range[2000], IntegerQ[Log[3, Times @@ (IntegerDigits[#])]] &]
PROG
(Haskell)
a174813 n = a174813_list !! (n-1)
a174813_list = f [1] where
f ds = foldr (\d v -> 10 * v + d) 0 ds : f (s ds)
s [] = [1]; s (9:ds) = 1 : s ds; s (d:ds) = 3*d : ds
-- Reinhard Zumkeller, Jan 13 2014
CROSSREFS
Sequence in context: A101620 A235583 A287333 * A116444 A215820 A065136
KEYWORD
nonn,base
AUTHOR
Michel Lagneau, Dec 01 2010
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 December 9 02:18 EST 2023. Contains 367681 sequences. (Running on oeis4.)