![]() |
![]() |
#34 | |
Apr 2013
Germany
2·3·53 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#35 |
Oct 2006
Berlin, Germany
659 Posts |
![]()
The list up to 2e6 is now complete loaded into the reservation page and all sequences are also created in FDB.
As next step we feed our by double check found list and check for merges. |
![]() |
![]() |
![]() |
#36 |
Apr 2013
Germany
2·3·53 Posts |
![]()
Thanks to a software update from Dubslow we are now more easily able to add new sequences and better check for mergers (and delete merges immediately). Thus I started the mentioned double check of u2d's list for 1e6 aliquot sequences.
The first finding is 1010274 which seems to merge with an earlier sequence but we can't tell which one at the moment. This will sort itself out over time once the smaller sequences are up to date again. |
![]() |
![]() |
![]() |
#37 |
"Forget I exist"
Jul 2009
Dartmouth NS
2×3×23×61 Posts |
![]()
I'll just point out, for the sake of saying something, that these are the obvious pairs ((p+1,p^2) where p is prime):
Code:
1010,1018081 1014,1026169 1020,1038361 1022,1042441 1032,1062961 1034,1067089 1040,1079521 1050,1100401 1052,1104601 1062,1125721 1064,1129969 1070,1142761 1088,1181569 1092,1190281 1094,1194649 1098,1203409 1104,1216609 1110,1229881 1118,1247689 1124,1261129 1130,1274641 1152,1324801 1154,1329409 1164,1352569 1172,1371241 1182,1394761 1188,1408969 1194,1423249 1202,1442401 1214,1471369 1218,1481089 1224,1495729 1230,1510441 1232,1515361 1238,1530169 1250,1560001 1260,1585081 1278,1630729 1280,1635841 1284,1646089 1290,1661521 1292,1666681 1298,1682209 1302,1692601 1304,1697809 1308,1708249 1320,1739761 1322,1745041 1328,1760929 1362,1852321 1368,1868689 1374,1885129 1382,1907161 1400,1957201 1410,1985281 Last fiddled with by science_man_88 on 2017-11-09 at 19:27 |
![]() |
![]() |
![]() |
#38 |
May 2009
Moscow, Russia
288910 Posts |
![]()
Is it possible to add extra checkbox 'Exclude sequences above 1e6' on https://www.rechenkraft.net/aliquot/AllSeq.html page? Thank you in advance.
|
![]() |
![]() |
![]() |
#39 | |
Apr 2013
Germany
31810 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#40 |
"Forget I exist"
Jul 2009
Dartmouth NS
100000111000102 Posts |
![]()
I'm guessing the list is checked against numbers that show up in other sequences already ?
|
![]() |
![]() |
![]() |
#41 | |
Oct 2006
Berlin, Germany
65910 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#42 |
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88
11100001101012 Posts |
![]()
Although your commit looks reasonable, per yoyo's post it should not be necessary in the first place. It is already possible to filter the sequences by giving a range of allowed values, such as for instance a maximum of 1e6 (or any other range you want).
|
![]() |
![]() |
![]() |
#43 |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
1005310 Posts |
![]()
1526586 merges with 1514622
1544394 merges with 780906 1585992 merges with 289848 1557786 merges with 664410 1552182 merges with 302226 1523886 merges with 26340 Remove them As a general rule, don't even insert into the web table the values that merge into another, lesser sequence within 10-20 iterations. This is extremely easy to calculate in gp. Don't stress both the AllSeq page and FactorDB with these useless queries. |
![]() |
![]() |
![]() |
#44 |
"Forget I exist"
Jul 2009
Dartmouth NS
841810 Posts |
![]()
so are the ones starting under 1 million that move to above 1 million there are 62105 such sequences in the first step. 60004 of which stay under 2 million within that step.
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Aliquot Sequences Summary Page | kar_bon | Aliquot Sequences | 174 | 2022-03-19 13:07 |
Sequences from the 5 to 10 million range | Greebley | Aliquot Sequences | 7 | 2015-09-04 08:22 |
Broken aliquot sequences | schickel | FactorDB | 18 | 2013-06-12 16:09 |
A new theorem about aliquot sequences | garambois | Aliquot Sequences | 34 | 2012-06-10 21:53 |
poaching aliquot sequences... | Andi47 | FactorDB | 21 | 2011-12-29 21:11 |