OFFSET
1,2
COMMENTS
LINKS
Bert Dobbelaere, Table of n, a(n) for n = 1..65
Bert Dobbelaere, C++ program for A304241 and A304242
G. Hurst, Computations of the Mertens Function and Improved Bounds on the Mertens Conjecture, arXiv:1610.08551 [math.NT], 2016-2017.
PROG
(PARI) L=M=0; for(n=1, oo, if(m=merten(n), abs(m)>abs(M) && [M, N]=[m, n], abs(M)>abs(L) && (L=M) && print1(L", "); M=0))
(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"))}
CROSSREFS
KEYWORD
sign,hard
AUTHOR
M. F. Hasler, May 08 2018
EXTENSIONS
More terms from Bert Dobbelaere, Oct 30 2018
STATUS
approved