|
Search: id:A077472
|
|
|
| A077472 |
|
Greedy powers of (5/8): sum_{n=1..inf} (5/8)^a(n) = 1. |
|
+0
8
|
|
| 1, 3, 5, 8, 10, 13, 15, 23, 26, 30, 33, 36, 38, 46, 48, 51, 53, 57, 61, 64, 66, 69, 72, 76, 78, 84, 88, 93, 95, 104, 106, 110, 115, 117, 121, 126, 129, 131, 136, 138, 143, 148, 150, 152, 157, 160, 164, 169, 172, 175, 179, 181, 185, 187, 191, 196, 198, 201, 203
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
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.
A heuristic argument suggests that the limit of a(n)/n is m - sum_{n=m..inf} log(1 + x^n)/log(x) = 3.9944918847..., where x=5/8 and m=floor(log(1-x)/log(x))=2. - Paul D. Hanna (pauldhanna(AT)juno.com), Nov 16 2002
|
|
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=(5/8) and frac(y) = y - floor(y).
a(n) seems to be asymptotic to c*n with c around 3.4... - Benoit Cloitre (benoit7848c(AT)orange.fr)
|
|
EXAMPLE
|
a(3)=5 since (5/8) +(5/8)^3 +(5/8)^5 < 1 and (5/8) +(5/8)^3 +(5/8)^4 > 1.
|
|
MATHEMATICA
|
s = 0; a = {}; Do[ If[s + (5/8)^n < 1, s = s + (5/8)^n; a = Append[a, n]], {n, 1, 210}]; a
heuristiclimit[x_] := (m=Floor[Log[x, 1-x]])+1/24+Log[x, Product[1+x^n, {n, 1, m-1}]/DedekindEta[I Log[x]/-Pi]*DedekindEta[ -I Log[x]/2/Pi]]; N[heuristiclimit[5/8], 20]
|
|
CROSSREFS
|
Cf. A077468, A077469, A077470, A077471, A077473, A077474, A077475.
Sequence in context: A094227 A085225 A080370 this_sequence A004937 A060606 A050504
Adjacent sequences: A077469 A077470 A077471 this_sequence A077473 A077474 A077475
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Paul D. Hanna (pauldhanna(AT)juno.com), Nov 06 2002
|
|
EXTENSIONS
|
Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Nov 08 2002. Also extended by Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 06 2002
|
|
|
Search completed in 0.002 seconds
|
