login
A093082
Number of steps to factor n!-1 using Fermat's factorization method.
2
1, 1, 8, 2, 334, 2450, 688, 958, 60676, 151, 239478914, 1718557, 43588850341, 44525, 3435544097, 128202996855, 166046498, 468640744, 9748065626452, 2406214305714, 54782975386, 249195119225246375, 20940713346, 57388133232314021954, 9869596698791300782235, 187739128455384480612259907, 184395236716104
OFFSET
2,3
LINKS
Harry J. Smith and Max Alekseyev, Table of n, a(n) for n = 2..135
FORMULA
For n>2, a(n) = (d + (m)/d)/2 - floor(sqrt(m)), where m=n!-1 and d is the smallest divisor of m such that d >=sqrt(m). - Max Alekseyev, Apr 13 2009
PROG
(PARI) { a(n) = my(m); if(n==2, return(1)); m=n!-1; fordiv(m, d, if(d*d>=m, return((d+m\d)\2-sqrtint(m)); ); ) } /* Max Alekseyev, Apr 13 2009 */
CROSSREFS
Cf. A078753.
Sequence in context: A188898 A176860 A281068 * A107671 A271174 A216891
KEYWORD
hard,nonn
AUTHOR
Jason Earls, May 09 2004
EXTENSIONS
Extended by Max Alekseyev, Apr 13 2009
a(60)-a(135) from Max Alekseyev, Dec 29 2015
STATUS
approved