The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A103332 Min[pn^bn] over all sorted multiplicative partitions of n! of length n. 1

%I

%S 3,5,5,7,7,8,8,11,11,13,13,13,13,17,17,19,19,19,19,23,23,25,25,25,25,

%T 29,29,31,31,31,31,31,31,37,37,37,37,41,41,43,43,43,43,47,47,49,49,49,

%U 49,53,53,53,53,53,53,59,59,61,61,61,61,61,64,67,67,67,67,71,71,73,73,73

%N Min[pn^bn] over all sorted multiplicative partitions of n! of length n.

%C a(n) >= A007917(n); a(n) is a power of some prime p <= n.

%o (PARI) works(n, m) = local(f, s, l, p, x); f = factor(n!); s = 0; l = matsize(f)[1]; if (f[l, 1] > m, return(0)); for (i = 1, l, p = f[i, 1]; x = 1; while (p^x <= m, x++); x--; s += f[i, 2]\x; if (f[i, 2]%x, s++)); s <= n; a(n) = local(f, m); f = factor(n); m = f[matsize(f)[1], 1]; while (!works(n, m), m++); m

%Y Cf. A085289, A085290.

%K nonn,less

%O 4,1

%A _David Wasserman_, Jan 31 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 18 21:20 EST 2020. Contains 332028 sequences. (Running on oeis4.)