OFFSET
1,3
COMMENTS
LINKS
Juan Arias-de-Reyna, Table of n, a(n) for n = 1..5000
Vladimir Shevelev, A fast computation of density of exponentially S-numbers, arXiv:1602.04244 [math.NT], 2016.
MATHEMATICA
M = 6; K = 50; (* To get the first 50 terms *)
f = 1 - x^3 + Sum[x^(2^r) - x^(2^r + 1), {r, 2, M}];
S = Series[Log[f], {x, 0, K}];
If[2^M <= K, Print["Warning: 2^M should be greater than K and it is not. Change parameters."]];
L = CoefficientList[S, x];
A271726[n_] := n L[[n + 1]];
Table[A271726[n], {n, 1, K}]
CROSSREFS
KEYWORD
sign
AUTHOR
Juan Arias-de-Reyna, Apr 13 2016
STATUS
approved