[seqfan] Re: FW: A100083
maxale at gmail.com
Wed Jun 12 05:57:06 CEST 2013
Furthermore, after each such N, the next term is either a prime power
p^(k+1) such that p^k divides N, or a prime.
On Tue, Jun 11, 2013 at 7:45 PM, Robert Gerbicz
<robert.gerbicz at gmail.com> wrote:
> Currently the known terms are the divisors of N=92504=2^3*31*373. And this
> will remain in the future, just for a possibly bigger N value.
> 2013/6/12 Robert Gerbicz <robert.gerbicz at gmail.com>
>> My submitted comment: If n is in the sequence and k|n then k is also in
>> the sequence. In the other direction if s and t is in the sequence and
>> gcd(s,t)=1 then n=s*t is also in the sequence. This gives that we need to
>> check only the primepowers, then we can easily build the rest of the
>> sequence. The primepowers in the sequence begins with: 2,4,8,31,373
>> ps. This can also speedup a naive search.
>> 2013/6/11 Giovanni Resta <g.resta at iit.cnr.it>
>>> On 06/11/2013 09:33 PM, Harvey P. Dale wrote:
>>>> That might suggest that the next term of the "reduced series" is
>>> either 4312999 (373 x 11563) or
>>> > perhaps 133702969 (31 x 373 x 11563).
>>> I've not reached these two values (I'm just at 3.3*10^6 and the program
>>> becomes slower and slower), but I've checked them directly and they do not
>>> seem to belong to the sequence.
>>> Seqfan Mailing list - http://list.seqfan.eu/
> Seqfan Mailing list - http://list.seqfan.eu/
More information about the SeqFan