[seqfan] Re: b-files for apparently matching sequences?

Joerg Arndt arndt at jjj.de
Wed Jun 30 20:03:50 CEST 2010

* Ron Hardin <rhhardin at att.net> [Jun 30. 2010 19:46]:
> I've put up a catalog of results so far (updated irregularly) for all A B at
> http://rhhardin.home.mindspring.com/current2.txt

fine work!
suggest splitting into auto-named files like A-B.txt

> if anybody wants to search for a formula.
> Note that a recurrence is likely to be huge.
> http://www.research.att.com/~njas/sequences/A72853 has one out to a(n-34)
> (which recurrence checked correct, by the way; though the a(n) listed is limited by 3 lines to less than 34 terms.)

I am surprise by the 'size' of this recursion.

So by

> [...]
> A closed from 
> > for the recurrence for P(A,B,n) would be a nice.

I hereby mean a procedure to generate a formula  ;-)

Are you using Knuth 'perms with conditions on prefixes'
algorithm for enumeration (by generation)?
hm..., hardly, unless you have overclocked your CPU
by a truly amazing factor:

4 3 100 9276214007544699392817874641185108428600630913087280

More information about the SeqFan mailing list