reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
Sum_{k=1..n} a(k) ~ n * (log(log(n)) + B + C), where B is Mertens's constant (A077761) and C = Sum_{p prime} f(1/p) = 0.28135949730844648114..., where f(x) = -1 - (x + 1) + (1-x) * Product_{k>=0} (1 + 2*x^(2^k)). - Amiram Eldar, Sep 29 2023
Sum_{k=1..n} a(k) ~ n * (log(log(n)) + B + C), where B is Mertens's constant (A077761) and C = Sum_{p prime} f(1/p) = 0.28135949730844648114..., where f(x) = -1 - x + (1-x) * Product_{k>=0} (1 + 2*x^(2^k)). - Amiram Eldar, Sep 29 2023
approved
editing
editing
approved
The sums of the first 10^k terms for k = 1, 2, ..., are 3, 48, 505, 5144, 51702, 517594, 5177430, 51778516, 517796372, 5177995095, ... Apparently, this sequence has an asymptotic mean 0.517...
nonn,easy
Wrong comment removed by Amiram Eldar, Sep 22 2023
approved
editing
editing
approved
The sums of the first 10^k terms for k = 1, 2, ..., are 3, 48, 505, 5144, 51702, 517594, 5177430, 51778516, 517796372, 5177995095, ... Apparently, this sequence has an asymptotic mean 0.507517...
approved
editing
proposed
approved