proposed
approved
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”).
proposed
approved
editing
proposed
G. Hurst, <a href="https://arxiv.org/abs/1610.08551">Computations of the Mertens Function and Improved Bounds on the Mertens Conjecture</a>
G. Hurst, <a href="https://arxiv.org/abs/1610.08551">Computations of the Mertens Function and Improved Bounds on the Mertens Conjecture</a>, arXiv:1610.08551 [math.NT], 2016-2017.
proposed
editing
editing
proposed
1, -4, -6, -8, -9, -12, -15, -16, -25, -29, 35, -43, 51, -72, 73, -88, 96, -113, -132, -134, -154, 240, -258, -278, -368, 432, 550, -683, -847, 1060, -1078, 1240, -1447, -2573, 2845, -3448, -4610, -6226, 6695, -8565, 9132, 10246, -15335, -17334, 21777, -25071
Bert Dobbelaere, <a href="/A304242/b304242.txt">Table of n, a(n) for n = 1..65</a>
sign,hard,more
More terms from Bert Dobbelaere, Oct 30 2018
approved
editing
editing
approved
Increasingly larger maxima, (in absolute value, ) extrema of the Mertens function A002321 between subsequent zeros.
(PARI) print1(j=1); for(i=1, #A051402-1, while( A028442[j] < A051402[i], j++); if( A028442[j-(j>1)]<=A051402[i] && A028442[j] < A051402[i+1], print1(", "A002321(A051402[i])))) \\ Using precomputed vectors A002321 and A051402, e.g. from the b-files: {c=0; AX=apply(t->fromdigits(digits(t)[#Str(c++)+1..-1]), readvec("/tmp/bX.txt"))}
proposed
editing
editing
proposed
1, -4, -6, -8, -9, -12, -15, -16, -25, -29, 35, -43, 51, -72, 73, -88, 96, -113, -132, -134, -154, 240, -258, -278, -368, 432, 550, -683, -847
sign,changedhard,more
proposed
editing