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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A355192 Factorial splitting: write n! = x*y*z with x <= y <= z and minimal z-x; sequence gives value of z-x. 4
 0, 0, 1, 2, 2, 2, 2, 6, 4, 2, 22, 28, 42, 72, 112, 288, 420, 720, 1568, 1920, 3512, 16560, 19686, 16028, 71280, 182160, 184320, 552960, 2925648, 4885160, 12080640, 32861900, 71559680, 77631750, 217165824, 604653336, 368858880, 4069377144, 7919402400, 17537715360, 87352688640, 127718553600 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS a(n) <= A061033(n). n=61 gives the smallest example where the value of x is not maximal (cf. A061030) and the value of z is not minimal. Apparently we have x < y < z for all n > 9. If so, using strict inequalities x < y < z in the definition would make the sequence undefined for n < 3 and affect only a(9) by switching from 9! = 70*72*72 to 9! = 63*72*80. LINKS Max Alekseyev, Table of n, a(n) for n = 0..100 CROSSREFS Cf. A061030, A061031, A061032, A061033, A060776, A060777, A060795, A060796, A200743, A200744, A355189, A355190, A355191. Sequence in context: A096625 A263455 A283677 * A260983 A103222 A319100 Adjacent sequences: A355189 A355190 A355191 * A355193 A355194 A355195 KEYWORD nonn AUTHOR Max Alekseyev, Jun 23 2022 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 December 9 02:22 EST 2022. Contains 358698 sequences. (Running on oeis4.)