cp's OEIS Frontend

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.

A085290 Max[p1^b1] over all sorted multiplicative partitions of n! of length n.

This page as a plain text file.
%I A085290 #9 Feb 16 2025 08:32:50
%S A085290 2,2,2,2,2,3,3,3,3,3,3,4,4,4,4,4,5,5,5,5,5,5,5,5,7,7,7,7,7,7,7,7,8,8,
%T A085290 8,8,8,8,8,8,8,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,11,11,11,11,11,11,11,11,
%U A085290 11,11,11,11,13,13,13,13,13,13,13,13,13,13,13,13,13,16,16,16,16,16,16,16
%N A085290 Max[p1^b1] over all sorted multiplicative partitions of n! of length n.
%H A085290 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Alladi-GrinsteadConstant.html">Alladi-Grinstead Constant</a>
%e A085290 6! = 2*2*2*2*5*9 = 2*2*3*3*4*5, the smallest terms of which are 2 and 2, so a(6)=Max[2,2]=2.
%o A085290 (PARI) works(n, m) = local(f, s, l, p, x); f = factor(n!); s = 0; l = matsize(f)[1]; for (i = 1, l, p = f[i, 1]; x = 1; while (p^x < m, x++); s += f[i, 2]\x; if (f[i, 2] < x, return(0))); s >= n; a(n) = local(f, m); f = factor(n); m = 2; while (works(n, m), m++); m - 1 \\ _David Wasserman_, Jan 31 2005
%Y A085290 Cf. A085288, A085289, A085291.
%Y A085290 Cf. A103332.
%K A085290 nonn
%O A085290 4,1
%A A085290 _Eric W. Weisstein_, Jun 23 2003
%E A085290 More terms from _David Wasserman_, Jan 31 2005