Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!nstn.ns.ca!news.cs.indiana.edu!spool.mu.edu!sdd.hp.com!zaphod.mps.ohio-state.edu!cis.ohio-state.edu!tut.cis.ohio-state.edu!ucbvax!UNI-PADERBORN.DE!atze
From: atze@UNI-PADERBORN.DE (Ralf Klasing)
Newsgroups: comp.theory
Subject: Closed form solution to a recurrence
Message-ID: <9105231143.AA25697@dali.uni-paderborn.de>
Date: 23 May 91 13:32:19 GMT
Sender: daemon@ucbvax.BERKELEY.EDU
Reply-To: Ralf Klasing <atze%uni-paderborn.de@VM1.NoDak.EDU>
Lines: 27

I'm desperately looking for a closed formula of the
following recurrence relation

  A(0,0) = 1
  A(0,i) = 0  for all i <> 0
  A(1,0) = A(1,1) = 1
  A(1,i) = 0 for all i <> 0,1

  A(i,k) = A(i-1,k) + A(i-2,k-1) for all i >= 2

This relation is similar to the recursive definition
of binomial coefficients, but it looks like it is a
lot harder to tackle.
If somebody can help me with this problem or can give
me an appropriate reference, I would be very grateful.

           Thanks a lot in advance

                        Ralf Klasing


------------------------------------------------------
+    Ralf Klasing                                    +
+    Department of Mathematics and Computer Science  +
+    University of Paderborn, Germany                +
+    E-mail: Ralf.Klasing@uni-paderborn.de           +
------------------------------------------------------