Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068183
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068183 Largest number without decimal digits equal to 1, whose product of digits gives n!. +0
10
2, 32, 3222, 53222, 5332222, 75332222, 75332222222, 7533332222222, 755333322222222 (list; graph; listen)
OFFSET

2,1

FORMULA

a(n)=Max{x; f[x]=n!}, where x has no digit=1 and f[x_] := Apply[Times, IntegerDigits[x]].

EXAMPLE

Maximal solutions are obtained from concatenation of distinct all prime-factors which has one decimal digit. The sequence is finite because n! for n>10 has 2-digit prime-factors.

CROSSREFS

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

Adjacent sequences: A068180 A068181 A068182 this_sequence A068184 A068185 A068186

Sequence in context: A088386 A093584 A117259 this_sequence A053853 A018241 A012599

KEYWORD

base,fini,nonn,full

AUTHOR

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

page 1

Search completed in 0.002 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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research