From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: *
X-Spam-Status: No, score=1.1 required=5.0 tests=BAYES_20,INVALID_DATE
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,55603c56db8d8307
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 1994-09-20 22:59:46 PST
Path: 
 bga.com!news.sprintlink.net!howland.reston.ans.net!EU.net!Germany.EU.net!pophh!nordwest.germany.eu.net!krishna!news 	
From: pk@orthogon.de (pk)
Newsgroups: comp.lang.ada
Subject: Re: Fibonacci Numbers?
Date: 20 Sep 1994 06:36:51 GMT
Organization: Orthogon System GmbH
Message-ID: <35lvu3$fph@krishna.orthogon.de>
References: <35fl28$1h3@garuda.csulb.edu>
NNTP-Posting-Host: pk.orthogon.de
X-Newsreader: WinVN 0.92.3
Date: 1994-09-20T06:36:51+00:00
List-Id: <comp.lang.ada>

In article <35fl28$1h3@garuda.csulb.edu>, zoltan@csulb.edu (S. Hegede) says:
> I only need help on getting the formula down that would
>calculate the next number in the series.

f(n+1) = f(n) + f(n-1)