login
This site is supported by donations 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
1, 2, 1, 1, 29, 1, 161, 207, 163047, 19952084, 1395363, 37433304, 1894884996, 22006266, 5012512, 159420748, 7687917, 856655287905375, 57388884947, 1344799562797, 46899771521770733, 74069716582896006, 382520592142795071229, 19340660897970532723387 (list; graph; refs; listen; history; internal format)
OFFSET

2,2

FORMULA

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

EXAMPLE

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

CROSSREFS

Cf. A078753, A093082.

Sequence in context: A156725 A141904 A147802 * A132454 A182911 A058293

Adjacent sequences:  A093073 A093074 A093075 * A093077 A093078 A093079

KEYWORD

nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), May 09 2004

EXTENSIONS

More terms from Sean A. Irvine (sairvin(AT)xtra.co.nz), Apr 08 2010

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 | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 10:06 EST 2012. Contains 205763 sequences.