This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A103332 #3 Mar 31 2012 13:20:57 %S A103332 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 A103332 29,29,31,31,31,31,31,31,37,37,37,37,41,41,43,43,43,43,47,47,49,49,49, %U A103332 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 A103332 Min[pn^bn] over all sorted multiplicative partitions of n! of length n. %C A103332 a(n) >= A007917(n); a(n) is a power of some prime p <= n. %o A103332 (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 A103332 Cf. A085289, A085290. %K A103332 nonn,less %O A103332 4,1 %A A103332 _David Wasserman_, Jan 31 2005