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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A061032 Factorial splitting: write n! = x*y*z with x<y<z and x maximal and z is minimal; sequence gives value of z. 11

%I #10 Jun 18 2022 15:37:22

%S 3,4,6,10,21,36,81,168,360,810,1872,4480,11088,27720,71280,186368,

%T 496128,1347192,3720960,10407936,29576988,85322160,249500160,

%U 738904320,2216712960,6732000000,20680540160,64260000000,201860859375

%N Factorial splitting: write n! = x*y*z with x<y<z and x maximal and z is minimal; sequence gives value of z.

%C We first maximize x and then minimize z, which may be different from doing the opposite way around. For example, 7! = 15*16*21 = 14*18*20 is the case when absolute maximum of x (=15) and absolute minimum of z (=20) cannot be achieved together. - _Max Alekseyev_, Jun 18 2022

%D Luc Kumps, personal communication.

%H Max Alekseyev, <a href="/A061032/b061032.txt">Table of n, a(n) for n = 3..100</a>

%Y Cf. A061030, A061031, A061033, A060776, A060777, A060795, A060796, A200743, A200744.

%K nonn

%O 3,1

%A _Ed Pegg Jr_, May 25 2001

%E a(10) and a(11) corrected and a(14)-a(31) from _Donovan Johnson_, May 11 2010

%E Definition and a(14), a(18), a(24) are corrected by _Max Alekseyev_, Apr 10 2022

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 16 12:57 EDT 2024. Contains 375976 sequences. (Running on oeis4.)