login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A112866 If a(n-1) is the i-th Fibonacci number then a(n)=Fibonacci(i+a(n-2)); with a(1)=1, a(2)=2 and where we use the following nonstandard indexing for the Fibonacci numbers: f(n)=f(n-1)+f(n-2), f(1)=1, f(2)=2 (cf. A000045). 3
1, 2, 3, 8, 34, 1597, 20365011074 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

The next term has 345 digits and is not displayed here.

LINKS

Table of n, a(n) for n=1..7.

EXAMPLE

a(5)=Fibonacci(5+3)=34 because a(4) is 5th Fibonacci number and a(3)=3

MAPLE

f := proc(n)

    combinat[fibonacci](n+1) ;

end proc:

Fidx := proc(n)

    for i from 1 do

        if f(i) = n then

            return i;

        elif f(i) > n then

            return -1 ;

        end if;

    end do:

end proc:

A112866 := proc(n)

    option remember;

    if n<= 2 then

        n;

    else

        i := Fidx(procname(n-1)) ;

        f( i+procname(n-2)) ;

    end if:

end proc: # R. J. Mathar, Nov 26 2011

CROSSREFS

Cf. A112237, A000045, A112601.

Sequence in context: A084908 A078742 A005370 * A041657 A191274 A041789

Adjacent sequences:  A112863 A112864 A112865 * A112867 A112868 A112869

KEYWORD

nonn

AUTHOR

Yasutoshi Kohmoto, Dec 25 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 18 10:47 EST 2022. Contains 350454 sequences. (Running on oeis4.)