Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A109103
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A109103 Smallest a(n) so that a(n)! can be expressed as the product of smaller factorials, using n distinct factorials greater than 1 (with repetitions allowed). +0
5
4, 9, 288, 34560 (list; graph; listen)
OFFSET

2,1

EXAMPLE

34560 = 2! * 3! * 4! * 5! * 34559!, five different factorials used, so a(5)=34560.

CROSSREFS

Cf. A034878, A001013, A003135, A058295, A075082, A109095, A109096, A109097, A109098, A109099, A109100, A109101, A109102.

Sequence in context: A167657 A035126 A051671 this_sequence A029734 A085065 A068708

Adjacent sequences: A109100 A109101 A109102 this_sequence A109104 A109105 A109106

KEYWORD

nonn

AUTHOR

Jud McCranie (j.mccranie(AT)comcast.net), Jun 19 2005

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research