login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A348126
a(n) is the least k for which x(k) > Sum_{j=1..k} 1/j, where x(k) is the Newton iterate (starting from x(1)=1) for exp(-P(n,x)) and P(n,x) is the n-th Maclaurin polynomial for exp(x).
0
2, 3, 11, 36, 104, 287, 776, 2074, 5519, 14672, 38999, 103709, 275970, 734862, 1958108, 5220797, 13927895, 37176046, 99277815, 265238573, 708928640, 1895558566, 5070252360
OFFSET
1,1
COMMENTS
Conjecture: a(n) is finite for every positive integer n, and a(n) approaches infinity with n.
EXAMPLE
Let H(k) = Sum_{j=1..k} 1/j, i.e., the k-th harmonic number.
a(1)=2: Newton's method applied to f(x)=exp(-1-x) starting at x(1)=1 gives x(1)=1, x(2)=2, whereas H(1)=1 and H(2)=1.5.
a(3)=11: Newton's method applied to f(x) = exp(-1 - x - x^2/2 - x^3/6) starting at x(1)=1 gives x(10)=2.91631 and x(11)=3.03873, whereas H(10)=2.92897 and H(11)=3.01988.
PROG
(PARI)
a(n)=
{default(seriesprecision, n);
default(realprecision, max(38, 2*#digits(n!, 10)));
Tp = truncate(taylor(exp(x), x, n));
t=1.0;
hsum=1.0;
j=1;
while(t<=hsum, j=j+1; t=t+1.0/subst(Tp, x, t); hsum = hsum + 1.0/j);
j; }
CROSSREFS
Sequence in context: A305846 A057838 A219497 * A006497 A038912 A019361
KEYWORD
nonn,more
AUTHOR
Jennifer Sirkin, Oct 01 2021
EXTENSIONS
a(15) inserted by Jinyuan Wang, Dec 10 2021
STATUS
approved