login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068190 Largest number of which the product of digits equals n; a(n)=0 if no such number exists, e.g. when n has prime-factor larger than 7; no digit=1 is permitted to avoid infinite number of solutions. 1
0, 2, 3, 22, 5, 32, 7, 222, 33, 52, 0, 322, 0, 72, 53, 2222, 0, 332, 0, 522, 73, 0, 0, 3222, 55, 0, 333, 722, 0, 532, 0, 22222, 0, 0, 75, 33222, 0, 0, 0, 5222, 0, 732, 0, 0, 533, 0, 0, 32222, 77, 552, 0, 0, 0, 3332, 0, 7222, 0, 0, 0, 5322, 0, 0, 733, 222222, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

FORMULA

If solution exists a(n) is the concatenation of prime-factors with repetitions and in order of magnitude, otherwise a(n)=0.

CROSSREFS

Cf. A001222, A002473, A067734, A068183-A068187, A068189-A068191.

Sequence in context: A073647 A073646 A037276 * A084796 A084797 A163902

Adjacent sequences:  A068187 A068188 A068189 * A068191 A068192 A068193

KEYWORD

base,nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Feb 19 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 20:54 EST 2012. Contains 205966 sequences.