Fibonacci

[kohmoto]

    Hi, Emeric
    Sorry, I should write more explanation.

    n          ---->          Prime(n) 
    1                             2
    2                             3 
    3                             5 
    4                             7
    5                             11

    n         ---->          InversePrime(n)
    2                           1
    3                           2 
    5                           3
    7                           4
    11                         5

    a(5)=Prime(InversePrime(a(5-2))+a(5-1))=Prime(4+23)=103

    Yasutoshi    

----- Original Message ----- 
From: "Emeric Deutsch" <deutsch at duke.poly.edu>
To: "kohmoto" <zbi74583 at boat.zero.ad.jp>
Sent: Sunday, December 11, 2005 1:17 PM
Subject: Re: Fibonacci


> Yasutoshi,
> Please show me an example. For instance,
> how did you get 103?
> What is Prime(n)? the n-th prime?
> What is InversePrime(n)?
> Many thanks.
> Emeric
> 
> 
> On Sun, 11 Dec 2005, kohmoto wrote:
> 
>>    Neil
>>    I post a Fibonacci like sequence.
>>
>>
>>
>>    %S A000001 2, 3, 7, 23, 103, 613
>>    %N A000001 a(n)=Prime(InversePrime(a(n-2))+a(n-1))
>>    %C A000001 It is a generalization of Fibonacchi sequence.
>>                     Because if Prime(n) is replaced by Identity(n), then
>> the definition becomes as follows. Where Identity(n)=n.
>>                     a(n)=a(n-2)+a(n-1)
>>    %Y A000001 A111392
>>    %K A000001 none
>>    %O A000001 1,1
>>    %A A000001 Yasutsohi Kohmoto   zbi74583 at boat.zero.ad,jp
>>
>>    Yasutoshi
>>
>>
>