Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068190
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A068190
%S A068190 0,2,3,22,5,32,7,222,33,52,0,322,0,72,53,2222,0,332,0,522,73,0,0,3222,
%T A068190 55,0,333,722,0,532,0,22222,0,0,75,33222,0,0,0,5222,0,732,0,0,533,0,0,
%U A068190 32222,77,552,0,0,0,3332,0,7222,0,0,0,5322,0,0,733,222222,0,0,0,0,0
%N 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.
%F A068190 If solution exists a(n) is the concatenation of prime-factors with repetitions 
               and in order of magnitude, otherwise a(n)=0.
%Y A068190 Cf. A001222, A002473, A067734, A068183-A068187, A068189-A068191.
%Y A068190 Sequence in context: A073646 A109671 A037276 this_sequence A084796 A084797 
               A163902
%Y A068190 Adjacent sequences: A068187 A068188 A068189 this_sequence A068191 A068192 
               A068193
%K A068190 base,nonn
%O A068190 1,2
%A A068190 Labos E. (labos(AT)ana.sote.hu), Feb 19 2002

    
page 1

Search completed in 0.001 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research