cp's OEIS Frontend

A061481 a(n) = floor(e^(n/e)).

%I A061481 #19 Apr 28 2019 01:25:57
%S A061481 1,1,2,3,4,6,9,13,18,27,39,57,82,119,172,249,359,520,751,1085,1568,
%T A061481 2265,3272,4727,6830,9867,14255,20593,29751,42980,62092,89703,129591,
%U A061481 187216,270465,390733,564479,815485,1178106,1701972,2458784,3552126,5131643
%N A061481 a(n) = floor(e^(n/e)).
%C A061481 Integer part of the maximal product possible among numbers (not restricted to integers) that sum to n. Note that a(n) >= A000792(n).
%C A061481 Ignoring the first term, for n >= 1, 1,2,3,4,6,9,... is the maximal integer such that its positive real n-th root in an infinite power tower converges to a limit; e.g., for n=5, 6 is the maximal such integer and (6^(1/5))^((6^(1/5))^((6^(1/5))^(...))) converges (to 2.1991359...). Similar infinite power towers with the 5th roots of 1,2,3,4,5, respectively also converge. See comments and links associated with A073229 and A073230. These terms are also the numbers of such converging infinite power towers composed of n-th roots of positive integers. Disregarding the trivial power tower of 1s, 2 is the unique positive integer whose infinite power tower of its square root converges; the limit is 2 itself. - _Rick L. Shepherd_, Sep 30 2007
%H A061481 Harry J. Smith, <a href="/A061481/b061481.txt">Table of n, a(n) for n = 0..500</a>
%H A061481 E. F. Krause, <a href="http://www.jstor.org/stable/2690532">Maximizing The Product of Summands</a>, Mathematics Magazine, MAA Oct 1996, Vol. 69, no. 5 pp. 270-271.
%H A061481 D. J. Newman, <a href="http://dx.doi.org/10.1007/978-1-4613-8214-0">A Problem Seminar</a>, Problem 15 pp. 5; 15 Springer-Verlag NY 1982.
%t A061481 Table[ Floor[E^(n/E)], {n, 0, 35}] (* _Robert G. Wilson v_, Oct 23 2004 *)
%o A061481 (PARI) { default(realprecision, 100); e=exp(1); for (n=0, 500, write("b061481.txt", n, " ", floor(e^(n/e))) ) } \\ _Harry J. Smith_, Jul 23 2009
%Y A061481 Cf. A107586.
%Y A061481 Cf. A073229, A073230.
%K A061481 nonn
%O A061481 0,3
%A A061481 _Amarnath Murthy_, May 05 2001