OFFSET
1,2
COMMENTS
The n-th greedy power of x, when 0.5 < x < 1, is the smallest integer exponent a(n) that does not cause the power series sum_{k=1..n} x^a(k) to exceed unity.
FORMULA
a(n)=sum_{k=1..n}floor(g_k) where g_1=1, g_{n+1}=log_x(x^frac(g_n) - x) (n>0) at x=(e/4) and frac(y) = y - floor(y).
EXAMPLE
a(4)=13 since (e/4) +(e/4)^3 +(e/4)^13 < 1 and (e/4) +(e/4)^3 +(e/4)^12 > 1; since the power 12 makes the sum > 1, then 13 is the 3rd greedy power of (e/4).
MAPLE
Digits := 400: summe := 0.0: p := evalf(exp(1)/4.): pexp := p: a := []: for i from 1 to 800 do: if summe + pexp < 1 then a := [op(a), i]: summe := summe + pexp: fi: pexp := pexp * p: od: a;
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Ulrich Schimke (ulrschimke(AT)aol.com)
EXTENSIONS
Corrected by T. D. Noe, Nov 02 2006
STATUS
approved