Fibonacci

[kohmoto]

    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
 
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.seqfan.eu/pipermail/seqfan/attachments/20051211/124ada38/attachment.htm>