The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A076802 Greedy powers of the gamma constant (0.577215664...) Sum_{n=1..infinity} (gamma)^a(n) = 1. 5
 1, 2, 5, 7, 10, 18, 20, 22, 23, 26, 30, 33, 37, 41, 44, 46, 48, 49, 53, 56, 58, 59, 68, 69, 75, 77, 78, 81, 88, 90, 94, 96, 98, 100, 102, 105, 106, 109, 111, 116, 120, 122, 124, 126, 132, 135, 137, 140, 145, 152, 155, 157, 158, 162, 165, 168, 171, 174, 176, 178 (list; graph; refs; listen; history; text; internal format)
 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. LINKS 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 = gamma and frac(y) = y - floor(y). EXAMPLE a(3)=5 since (gamma) + (gamma)^2 + (gamma)^5 < 1 and (gamma) + (gamma)^2 + (gamma)^4 > 1; the power 4 makes the sum > 1, so 5 is the 3rd greedy power of gamma. MAPLE Digits := 400: summe := 0.0: p := evalf(gamma): 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 Cf. A077468 - A077475. Sequence in context: A345127 A226813 A355846 * A226650 A024374 A297103 Adjacent sequences:  A076799 A076800 A076801 * A076803 A076804 A076805 KEYWORD easy,nonn AUTHOR Ulrich Schimke (ulrschimke(AT)aol.com) EXTENSIONS Corrected by T. D. Noe, Nov 02 2006 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 15 07:14 EDT 2022. Contains 356128 sequences. (Running on oeis4.)