[seqfan] Re: Divisible by the digits of a(n-1)

[Lars Blomberg]

I found a way to avoid the explicit "used" list and after 22 days reached 
10000 terms for A237860, the largest being 891,356,053,262.

/Lars Blomberg

-----Ursprungligt meddelande----- 
From: Giovanni Resta
Sent: Saturday, February 15, 2014 11:56 AM
To: Sequence Fanatics Discussion list
Subject: [seqfan] Re: Divisible by the digits of a(n-1)

On 02/15/2014 01:06 AM, Reinhard Zumkeller wrote:

> For A237860 I'm calculating the first 100 terms, a(97) is still running
> (a(96) = 43).

I extended the b-file to 1380 terms (running time about 1 minute, but I
had to use most of my 32GB of RAM...)

Giovanni


_______________________________________________

Seqfan Mailing list - http://list.seqfan.eu/