[seqfan] Re: LRS formulas for n>=...?

rhhardin at att.net rhhardin at att.net
Mon Aug 3 10:56:09 CEST 2009

Yes, that looks good.

In fact just proving the existence of a recursion is enough to prove
an empirical recursion, with some decision about how many terms
it might have at most.

Enumeration of enough terms fades fast as m increases in nXm however.

rhhardin at mindspring.com
rhhardin at att.net (either)
-------------- Original message ----------------------
From: Hagen von Eitzen <math at von-eitzen.de>

> The recursions should be provable. For example with

More information about the SeqFan mailing list