Re: Solving recurrences.

Marko Riedel on Wed, 24 Mar 2004 23:02:55 +0100

[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

Re: Solving recurrences.

To: Michael Somos <somos@grail.cba.csuohio.edu>
Subject: Re: Solving recurrences.
From: "Marko Riedel" <mriedel@neuearbeit.de>
Date: Wed, 24 Mar 2004 22:55:58 +0100
Cc: pari-users@list.cr.yp.to
Cc: mriedel@neuearbeit.de
Delivery-date: Wed, 24 Mar 2004 23:02:56 +0100
In-reply-to: <200403241909.i2OJ9diB029898@grail.cba.csuohio.edu>
Mailing-list: contact pari-users-help@list.cr.yp.to; run by ezmlm
References: <200403241909.i2OJ9diB029898@grail.cba.csuohio.edu>

Hello there,

very impressive! Could you briefly explain what you are doing?

BTW I guess I didn't explain it well. You take the explicit formula to
the recurrence. I want to take the recurrence to the explicit formula,
i.e. turn

a(n-0)*(-n)
+a(n-1)*(2*n^2 + 3*n + 1)

into

(2*n+1)!*(n+1)/n!/2^n.

Best regards,

-- 
+------------------------------------------------------------+
| Marko Riedel, EDV Neue Arbeit gGmbH, mriedel@neuearbeit.de |
| http://www.geocities.com/markoriedelde/index.html          |
+------------------------------------------------------------+

References:
- Re: Solving recurrences.
  - From: Michael Somos <somos@grail.cba.csuohio.edu>

Prev by Date: Re: Solving recurrences.
Next by Date: Re: Solving recurrences.
Previous by thread: Re: Solving recurrences.
Next by thread: Re: Solving recurrences.
Index(es):
- Date
- Thread