On 7/21/07, Fred lunnon <fred.lunnon@gmail.com> wrote: [...snip...]
A Maple script implementing this method is (hopefully) appended below: it finds B(n) for n = 173 in 1/4 sec, for n = 2999 in 20 sec on a Mac G4. [The Maple 10 library function took 102 sec for n = 170, was aborted after 480 sec for n = 173; Maple 9 aborted after similar time for n = 2999.]
I ran your maple code using Maple 7 (the only version I have) on an XP PC with Celeron 2.80 GHz, 504 MB Ram, and n = 173 took 0.21 seconds, and n = 2999 took 59 seconds. Probably I should have mentioned before (and you could have saved a couple of hours of search time) that (also with Maple 7) I searched up to n = 4000 using the built in Bell in the combinat package finding no Bell-pseudo-primes, and although I didn't time it, it took definitely less than 2 hours. Jim