No, n=2^2*3 is not a driver, but the 3 tends to linger a while (until no 2 (mod 3) prime factor to odd exponent appears in an interation) and σ(n)/n-1=4/3 so you usually gain a digit or two when a 3 appears.

Is someone doing NFS on i3242 c124?

Edit: thanks, Ben.

[QUOTE=akruppa;298784]Is someone doing NFS on i3242 c124?[/QUOTE]

I'll start on it.

Did the c124, a c117, and then another c124, along with assorted other stuff. Stepping out now on i3247 with a c119 that I haven't tested at all.

Sweet. Thanks for helping this along.

{sarcasm}
OMG, it's already there for three iterations. Last time, it was stuck for six!!*
{/sarcasm}

*..and don't even ask, it moves the sequence UP [SPOILER] = 2^2 · 5[/SPOILER]

[QUOTE=akruppa;298832]Sweet. Thanks for helping this along.[/QUOTE]:geek:

i3250 was even sweeter:[code] c130 = 2^2 * 965790972696315384966086853945791114057779457459931899639792547143707488146567493083304434873606920192324847235556269383685858089[/code]There's still good things happening for this one!

:party:

p39... p33... c95... c104...

So who did the deed after bsquared stopped?

line 3267:
[code]Using B1=4000000, B2=11415205630, polynomial Dickson(12), sigma=14220810860951883440
Step 1 took 8874ms
Step 2 took 6116ms
********** Factor found in step 2: 108909075340171324033834877863247334250507
Found probable prime factor of 42 digits: 108909075340171324033834877863247334250507
Probable prime cofactor 177864168042791473550628769400005983592699829761569883028664427 has 63 digits
[/code]

Ach. Lost the driver again.