Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A112866
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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). +0
3
1, 2, 3, 8, 34, 1597 (list; graph; listen)
OFFSET

1,2

EXAMPLE

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

CROSSREFS

Cf. A112237, A000045, A112601.

Sequence in context: A084908 A078742 A005370 this_sequence A041657 A041789 A093908

Adjacent sequences: A112863 A112864 A112865 this_sequence A112867 A112868 A112869

KEYWORD

nonn,more

AUTHOR

Yasutoshi Kohmoto zbi74583(AT)boat.zero.ad.jp, Dec 25 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research