50 largest factors found by ECM

eFT means eCompute Factoring Team. The notation [x^e] after the first limit bound B1 means that this factor was used with Suyama's extension, implemented up from version 3 of GMP-ECM, and that the smallest polynomial which finds this factor is x^e. a(n,k) denotes the n-th term from the sequence defined by a(1,k)=1 and a(n,k)=(1+sum(a(i,k),i=1..n-1))/(n-1). a(n,2) is sequence M0728 from the Encyclopedia of Integer Sequences, a(n,3) is sequence M1551, and a(n,4) is sequence M1957; A(n,k) denotes the k-th term of the aliquot sequence starting from n, i.e. A(n,0)=n and A(n,k+1)=sigma(A(n,k))-A(n,k) where sigma(m) is the sum of the divisors of m; AF(n) denotes the n-th alternating factorial n!-(n-1)!+(n-2)!-...; B(n) denotes the n-th Bell number, which is the numerator of the coefficient of x^n in the series expansion of exp(exp(x)-1) at x=0; Bern(n) denotes the numerator of the n-th Bernoulli number; C(n) denotes the n-th Cullen number n*2^n+1; C(n,k) denotes the binomial coefficient binomial(n,k); cp(n,k) denotes the n-th term from the concatenated primefactors sequence starting from n; E(n) is the n-th Euler number, i.e. the numerator of the coefficient of x^n in the series expansion of sec(x)+tan(x); HPnn(k) is the k-th of the Home Prime Sequence of nn; j(n) is the n-th coefficient of the elliptic modular function j(tau), i.e. the coefficient of x^n in series(jell(x),x) in Pari; J(n) is the n-th Jones number, i.e. binomial(2n-1,n)-1; L(n) is the n-th Lucas number; Mxxxx(n) represents the n-th term from sequence Mxxxx in Sloane and Plouffe Encyclopedia of Integer Sequences; M(a,n) denotes (a^n-1)^n+a^n-1; p(n) denotes the n-th partition number; RSm(n) denotes the n-th reverse Smarandache number; SC(n) denotes a term from the sigma-chain of n; SymSm(n) denotes the n-th symmetric Smarandache number, i.e. the concatenation of Sm(n) and RSm(n); T(n) is the n-th tangent number, i.e. the numerator of the coefficient of x^n in the series expansion of tan(x); V(p,q,n) is a^n+b^n where (a,b) are roots of x^2-p*x+q [sum(k^n, k=RootOf(x^2-p*x+q)) in Maple-notation]; W(n) denotes the n-th Woodall number n*2^n-1; W1(n) is the numerator of the n-th Wolstenholme number 1+1/2+...+1/n; c160 is related to the Euclid-Mullin graph.
[*] factor found in step 1;
[s/r] George Woltman's mprime program was used for step 1, and gmp-ecm for step 2, with the -resume option.
[c/s] factor found with the client/server setup
(1) K64=1!+2!+3!+...+64!;
(2) P1*P2*...*P66+P67 where Pn denotes the nth prime;
(3) special numbers: c93 is a divisor of p118-1, where p118 is a divisor of 10^211-1.
(4) these numbers had been independently factored by Samuel S. Wagstaff, Jr in 1995;