Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093076
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093076 Number of steps to factor n!+1 using Fermat's factorization method. +0
1
1, 2, 1, 1, 29, 1, 161, 207, 163047, 19952084, 1395363 (list; graph; listen)
OFFSET

2,2

EXAMPLE

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

CROSSREFS

Sequence in context: A156725 A141904 A147802 this_sequence A132454 A058293 A156888

Adjacent sequences: A093073 A093074 A093075 this_sequence A093077 A093078 A093079

KEYWORD

hard,more,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research