and i've inserted

ECM, 5500 curves, B1=11M, B2=?, Alex Kruppa, Paul Leyland
ECM, 9000 curves, B1=44M, B2=?, Alex Kruppa, Paul Leyland

(Note: B2-values are not available, so i inserted dummys)

from [url]http://www.worldofnumbers.com/topic1.htm[/url]
from 2004, so it's time to break this C204!

for more HP's base 10 i've inserted those:

start-number, index, Composite/Prime
49, 99, C204
146, 87, C173
234, 65, P130
242, 93, C175
312, 99, C162

all start-numbers <1000 with results can be found here:
[url]http://www.mersennewiki.org/index.php/Base_10_Home_Prime_Results[/url]

perhaps i include all start-numbers <1000 not ended in a prime later today.

All the links to sequences here are broken:
[url]http://factorization.ath.cx/search.php?seq=0[/url]
It's probably due to the new sequence types and the breaking of the old type of URLs/links/bookmarks.

[quote=kar_bon;171634]and i've inserted

ECM, 5500 curves, B1=11M, B2=?, Alex Kruppa, Paul Leyland
ECM, 9000 curves, B1=44M, B2=?, Alex Kruppa, Paul Leyland

(Note: B2-values are not available, so i inserted dummys)

from [URL]http://www.worldofnumbers.com/topic1.htm[/URL]
from 2004, so it's time to break this C204![/quote]

And (surprise surprise) an idiot put it up for "very high limits" at one point.

[quote=Andi47;171633]I just added the p+/-1 efforts which Alex and I did in spring 2008.

For P+1, I mis-counted the number of 0's - Alex did B2=10^17, not 10^14. @Syd, can you please correct that?[/quote]

Corrected.

[quote=Mini-Geek;171667]All the links to sequences here are broken:
[URL]http://factorization.ath.cx/search.php?seq=0[/URL]
It's probably due to the new sequence types and the breaking of the old type of URLs/links/bookmarks.[/quote]

now the old URLs work again - changed the links anyway.

Btw, adding other sequences that base on factorizations is easy now, just let me know and I'll add them.

[QUOTE=kar_bon;171634]and i've inserted

ECM, 5500 curves, B1=11M, B2=?, Alex Kruppa, Paul Leyland
ECM, 9000 curves, B1=44M, B2=?, Alex Kruppa, Paul Leyland

(Note: B2-values are not available, so i inserted dummys)

from [url]http://www.worldofnumbers.com/topic1.htm[/url]
from 2004, so it's time to break this C204![/QUOTE]

According to the [URL="http://mersennewiki.org/index.php/Base_10_Still_Open#HP49"]Mersennewiki[/URL], quite a number of curves have been done at B1=110M, but I don't know who is meant by the two-letter-abbreviations:

[code]228 @ 110M by AM
10000 @ 110M by SI
864 @ 110M by JG
366 @ 110M by Andi47
total: 13510[/code]

would it be sensible if for sequences a small amount of work is done by the workers automatically since it is only one number per sequence at once?
i am thinking maybe trial factoring and ecm to low limits

[quote=Andi47;171688]According to the [URL="http://mersennewiki.org/index.php/Base_10_Still_Open#HP49"]Mersennewiki[/URL], quite a number of curves have been done at B1=110M, but I don't know who is meant by the two-letter-abbreviations:

[code]228 @ 110M by AM
10000 @ 110M by SI
864 @ 110M by JG
366 @ 110M by Andi47
total: 13510[/code][/quote]

SI = Sean Irvine
JG = Jeff Gilchrist
AM = I'm not sure.

Other sequences
 

[quote=Syd;171684]
Btw, adding other sequences that base on factorizations is easy now, just let me know and I'll add them.[/quote]

For some reason, I've always been interested in the sequence described at [URL="http://www.research.att.com/%7Enjas/sequences/A031439"]http://www.research.att.com/~njas/sequences/A031439[/URL]

There are similar ones at [URL="http://www.research.att.com/%7Enjas/sequences/?q=langdeau"]http://www.research.att.com/~njas/sequences/?q=langdeau[/URL]

The general idea is to start with a polynomial with integer coefficients, such as [tex]p(x) = x^2+1[/tex]. A starting value of the sequence is chosen and each successive term [tex]a_n[/tex] is the greatest prime factor of [tex]p(a_{n-1})[/tex].

It is possible for a sequence to begin cycling, or become undefined if you try to find the gpf of -1, 0 or 1. For [tex]x^2+1[/tex], the only known cycles are [89, 233] and [19121, 10753313, 1241761, 3817193, 107837].

An important observation is to factor the polynomial into irreducible polynomials with integer coefficients. If all the factors are linear, it seems likely that every sequence will eventually repeat. However, if there are any factors that are not linear, then almost all of the sequences appear to grow without limit.

I haven't come across much information about these sequences and all of these so-called results are stuff I discovered myself.

VERY minor bug:

When you do "Show last 20 elements" of an aliquot sequence, it actually only shows 19 elements.

Aliquot sequence 4788, currently it shows n=2364 to n=2382.

[url]http://factorization.ath.cx/search.php?query=&se=1&aq=4788&action=last&fr=&to=[/url]

[QUOTE=10metreh;171702]SI = Sean Irvine
JG = Jeff Gilchrist
AM = I'm not sure.[/QUOTE]I'm not sure either, but could it be Alan McFarlane?

I don't think Alec Muffett is doing much factorization these days.

Paul