[QUOTE=EdH;550008]
For later, as to primes found within a sequence, will you need a count of each or just a list?[/QUOTE]

Thanks, Ed.
I'll need a count of every prime number, the list alone is not enough !
For a given sequence, how many times have we had the two, three, five, seven...
For example, for the sequence starting at 2^10, that would be :

Sequence :

[CODE]0 . 1024 = 2^10
1 . 1023 = 3 * 11 * 31
2 . 513 = 3^3 * 19
3 . 287 = 7 * 41
4 . 49 = 7^2
5 . 8 = 2^3
6 . 7 = 7[/CODE]Result :
[CODE][[2, 13], [3, 4], [7,4], [11,1], [19, 1], [31, 1], [41, 1]][/CODE]

[QUOTE=garambois;550021]Thanks, Ed.
I'll need a count of every prime number, the list alone is not enough !
For a given sequence, how many times have we had the two, three, five, seven...
For example, for the sequence starting at 2^10, that would be :

Sequence :

[CODE]0 . 1024 = 2^10
1 . 1023 = 3 * 11 * 31
2 . 513 = 3^3 * 19
3 . 287 = 7 * 41
4 . 49 = 7^2
5 . 8 = 2^3
6 . 7 = 7[/CODE]Result :
[CODE][[2, 13], [3, 4], [7,4], [11,1], [19, 1], [31, 1], [41, 1]][/CODE][/QUOTE]I will work on this, but it might be a little bit before I have it complete.

Meanwhile, I am attaching bases 2 - 7 statistics with the new format. I added 2 (prime) and 3 (cycle) to the c position, since they are neither abundant nor deficient. I also skipped all the open sequences. I used the following key, with no title, in the documents:
[code]

[a, b, c, d, e, f, g, h, i, j, k, l, m, n]
a : base
b : exponent
c : 0 if deficient, 1 if abundant, 2 if prime, 3 if perfect
d : number of total abundant terms
e : number of total deficient terms
f : most sequential abundant terms
g : most sequential deficient terms
h : parity changes even to odd
i : parity changes odd to even
j : number of abundant peaks
k : greatest abundant peak (2dd)
l : greatest peak larger than first term 1 if yes and 0 if no
m : last index
n : last term
[/code] I hope I got all this correct!:smile:

Edit: Actually, did you want the size of the highest peak or the term? I provided the term, but I can change that and rerun easily.

Edit2: The attachments were removed because they were flawed. The new (current) files can be found in [URL="https://www.mersenneforum.org/showpost.php?p=550114&postcount=339"]this new post[/URL].

[QUOTE=EdH;550039] I hope I got all this correct!:smile:
[/QUOTE]

I'll check it out, maybe even try to replicate your algorithm.
But I'm not sure I'll have the time to do all this before I go on holiday in a few days : there's nothing you can do against the call of the mountain !
So far I've done some manual checks, everything seems to be fine. But it's laborious to do so...


Before I leave, I think I'll concentrate on counting all the prime numbers of all the terms in a sequence, as in the example above.

In August, when I come back, I will have much more time for everything else.

[QUOTE=EdH;550039]
Edit: Actually, did you want the size of the highest peak or the term? I provided the term, but I can change that and rerun easily.[/QUOTE]

I think for the highest peak, the term is better, because there's more information than if you just give the size.

I have two questions:



1) Please, I'm not sure I understand the meaning of :
[CODE]l: greatest peak larger than first term 1 if yes and 0 if no[/CODE]Why, in the case of 2^i, is it always worth 1 ?
Indeed, the starting term of the sequence is always the largest, isn't it ?




2) The value of c is only about the first term of the sequence, isn't it ?
[CODE]c : 0 if deficient, 1 if abundant, 2 if prime, 3 if perfect[/CODE]

[QUOTE=garambois;550074]I have two questions:



1) Please, I'm not sure I understand the meaning of :
[CODE]l: greatest peak larger than first term 1 if yes and 0 if no[/CODE]Why, in the case of 2^i, is it always worth 1 ?
Indeed, the starting term of the sequence is always the largest, isn't it ?




2) The value of c is only about the first term of the sequence, isn't it ?
[CODE]c : 0 if deficient, 1 if abundant, 2 if prime, 3 if perfect[/CODE][/QUOTE]1) I have something wrong for that value. It is not always 1, but there are 60 sequences (2^1 - 2^539) where a peak exceeds the initial term. For example, see 2^12:
[code]
0 . [B]4096[/B] = 2^12
1 . 4095 = 3^2 * 5 * 7 * 13
2 . [B]4641[/B] = 3 * 7 * 13 * 17
3 . 3423 = 3 * 7 * 163
4 . 1825 = 5^2 * 73
5 . 469 = 7 * 67
6 . 75 = 3 * 5^2
7 . 49 = 7^2
8 . 8 = 2^3
9 . 7 = 7
[/code]Term 2 (4641) > term 0 (4096). Those 60 should show 1. I will have to fix that, but it will have to wait until later tonight or tomorrow morning. Sorry for the delay.:sad:

2) That is correct. The value c is about term 0 only. If term 0 is perfect, s(n)-n is equal to itself (neither deficient nor abundant), if prime, it's equal to 1 (deficient, but unique). I could flag primes as deficient, but it really wouldn't be the same as the others, since there are no terms after a prime termination. How would you like me to reflect perfect and prime for your needs?

[QUOTE=EdH;550078]1)Term 2 (4641) > term 0 (4096). Those 60 should show 1. I will have to fix that, but it will have to wait until later tonight or tomorrow morning. Sorry for the delay.:sad:
[/QUOTE]


Take your time.
As I said before, I'll be working on this in August...


:smile:

The first array is finished.
You can see it as an attachment (.pdf version).

It is difficult to draw definite conclusions because we don't have a lot of sequences that end for large bases after all.
But what I was hoping for is not happening.
[B]Sequences that start on integer powers seem to generally end with the same probability on the same prime numbers as all of the sequences.[/B]
So there's no obvious conjecture to be made... yet.

I will redo all this work by considering all the prime numbers that appear in all the terms of the sequences, as described above.
I will also publish the final array here.

If anyone has any questions or notices things that I wouldn't have seen when looking at this array, please feel free to express them here !

2 years ago I played around with aliquot sequences and graphviz, a free tool to display graphs.

The problem is you can not only include all relations automatically because the graph will grow and isn't easy to handle. So you have to create some sub-graphs to tidy up the image.

I've created a tree of squences ending in 43 with (I think all values<20000, no odd) and the result is an image.
The source is a text file ~10kB in the graphviz syntax (the extension has to be changed into 'gv' for graphviz).
The image was created with
[code]
dot -Tjpg 43.gv >43.jpg
[/code]

The problem here: the filesize is ~1.8MB (too big for jpg) and the dimensions (~10,000 x 2900 pixel, to big, too), so I uploaded it into the [url='https://www.rieselprime.de/z/images/4/4f/43.jpg']Wiki[/url].

Here are corrected statistics for bases 2-7:

I've started base 30 for n=1 to 20. At least half have trivially terminated. It will be slow going because I am using a C2D laptop part-time.

[QUOTE=kar_bon;550096]2 years ago I played around with aliquot sequences and graphviz, a free tool to display graphs.
. . .
[/QUOTE]This is impressive! I remember some of it from much longer ago, when the genealogy thread was active. Does 43 appear to be the most common termination at higher numbered sequences (>1M), as well?

[QUOTE=garambois;550021]Thanks, Ed.
I'll need a count of every prime number, the list alone is not enough !
For a given sequence, how many times have we had the two, three, five, seven...
For example, for the sequence starting at 2^10, that would be :

Sequence :

[CODE]0 . 1024 = 2^10
1 . 1023 = 3 * 11 * 31
2 . 513 = 3^3 * 19
3 . 287 = 7 * 41
4 . 49 = 7^2
5 . 8 = 2^3
6 . 7 = 7[/CODE]Result :
[CODE][[2, 13], [3, 4], [7,4], [11,1], [19, 1], [31, 1], [41, 1]][/CODE][/QUOTE]Do you need the sequence referenced or will the list suffice as each line corresponding to that power?

The table shows some interesting values, but as you say, these base tables are such a tiny portion of the overall, it's tough to find any commonalities.