[seqfan] Re: nice base-dependent sequence

franktaw at netscape.net franktaw at netscape.net
Sat May 29 11:36:47 CEST 2010

I don't think the "hard" keyword should be given just because the known 
algorithms are all slow. The sequence should be provably hard, or at 
least there should be some good evidence for its difficulty (i.e., 

Franklin T. Adams-Watters

-----Original Message-----
From: Hans Havermann <pxp at rogers.com>

> Anyone care to produce a b-file?

I think this will be a tough road. Perhaps the sequence even deserves
a "hard". Term #38 is 11525580.

More information about the SeqFan mailing list