[seqfan] Re: Purely algorithmic number sequence identification

W. Edwin Clark wclark at mail.usf.edu
Mon Feb 23 17:02:37 CET 2015

On Mon, Feb 23, 2015 at 5:42 AM, Olivier Gerard <olivier.gerard at gmail.com>

> It would be nice to test it on "hard" sequences and other sequences without
> formula.
For example:  http://oeis.org/A000001, the number of groups of order n :-)

Or perhaps easier:  http://oeis.org/A000688, the number of abelian groups
of order n.

More information about the SeqFan mailing list