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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A128557 a(n) = the largest positive integer k such that (n!/k!) has at least n divisors. 2
 1, 1, 1, 2, 3, 4, 5, 6, 7, 8, 8, 10, 10, 11, 13, 14, 14, 15, 16, 17, 19, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 34, 34, 35, 35, 37, 38, 39, 39, 41, 42, 43, 44, 45, 46, 47, 48, 49, 49, 51, 52, 53, 54, 55, 55, 57, 57, 59, 59, 61, 62, 63, 63, 64, 65, 67, 67, 69, 69 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS Table of n, a(n) for n=1..73. EXAMPLE a(11) = 8 because 11!/8! = 9*10*11 = 990 has 24 divisors (and 24 is >= 11), but 11!/9! = 10*11 = 110 has 8 divisors (and 8 is < 11). MAPLE with(numtheory): a:=proc(n) local A, k: A:={}: for k from 1 to n do if tau(n!/k!)>=n then A:=A union {k} else A:=A fi od: A[nops(A)]; end: seq(a(n), n=1..90); # Emeric Deutsch, Mar 23 2007 CROSSREFS Cf. A128558, A128559. Sequence in context: A274016 A291572 A265541 * A265542 A103303 A297232 Adjacent sequences: A128554 A128555 A128556 * A128558 A128559 A128560 KEYWORD nonn AUTHOR Leroy Quet, Mar 10 2007 EXTENSIONS More terms from Emeric Deutsch, Mar 23 2007 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.

Last modified August 7 20:39 EDT 2024. Contains 375017 sequences. (Running on oeis4.)