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 A227215 #27 Jun 13 2025 21:42:09
%S A227215 3,4,5,5,7,6,9,6,7,8,13,7,15,10,9,8,19,8,21,9,11,14,25,9,11,16,9,11,
%T A227215 31,10,33,10,15,20,13,10,39,22,17,11,43,12,45,15,11,26,49,11,15,12,21,
%U A227215 17,55,12,17,13,23,32,61,12,63,34,13,12,19,16,69,21,27,14,73,13,75,40,13
%N A227215 Smallest sum of the three perpendicular integer sides of a rectangular parallelepiped of volume n.
%H A227215 Charles R Greathouse IV, <a href="/A227215/b227215.txt">Table of n, a(n) for n = 1..10000</a>
%H A227215 Wikipedia, <a href="http://en.wikipedia.org/wiki/Parallelepiped">Parallelepiped</a>
%e A227215 a(24)=9 since 9=2+3+4 is the smallest sum of all possible parallelepipeds having 24=2*3*4 as volume.
%t A227215 a[n_] := Block[{x,y,z}, Min[Total /@ ({x, y, z} /. List@ ToRules@ Reduce[ x*y*z == n && x >= y >= z > 0, {x, y, z}, Integers])]]; Array[a, 75] (* _Giovanni Resta_, Sep 19 2013 *)
%o A227215 (PARI) a(n) = {smin = 3*n; for (i = 1, n, for (j = 1, i, for (k = 1, j, if (i*j*k == n, smin = min (smin, i+j+k));););); return (smin);} \\ _Michel Marcus_, Sep 23 2013
%o A227215 (PARI) a(n)=my(m=n+2,d); fordiv(n,x,d=divisors(n/x); m=min(m, d[(#d+1)\2]+d[#d\2+1]+x)); m \\ _Charles R Greathouse IV_, Sep 23 2013
%Y A227215 Cf. A063655, A033676.
%K A227215 nonn
%O A227215 1,1
%A A227215 _Carmine Suriano_, Sep 19 2013