login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093076 Number of steps to factor n!+1 using Fermat's factorization method. 0

%I #6 Dec 15 2017 17:36:34

%S 1,2,1,1,29,1,161,207,163047,19952084,1395363,37433304,1894884996,

%T 22006266,5012512,159420748,7687917,856655287905375,57388884947,

%U 1344799562797,46899771521770733,74069716582896006,382520592142795071229,19340660897970532723387

%N Number of steps to factor n!+1 using Fermat's factorization method.

%F For n>1, a(n) = A078753(n!/2).

%e To factor 9!+1 = 362881 using Fermat's method takes 207 iterations to reach 269 * 1349 (see A078753).

%Y Cf. A078753, A093082.

%K nonn

%O 2,2

%A _Jason Earls_, May 09 2004

%E More terms from _Sean A. Irvine_, Apr 08 2010

%E Further terms from Max Alekseyev, May 03 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 28 19:58 EDT 2024. Contains 374726 sequences. (Running on oeis4.)