Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A077537
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A077537 Sum of next F(n) Fibonacci numbers, where F(n) = n-th Fibonacci number. +0
1
0, 1, 1, 5, 26, 343, 17334, 9209754, 225842206252, 2880066968519382403, 898923707005599922079920034025, 3577855662560905980740035806138759999587547050967 (list; graph; listen)
OFFSET

0,4

FORMULA

First differences of A005370 = F(F(n+1)+1). - Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Nov 17 2002

EXAMPLE

a(0) =0, a(1) = 1, a(2) = 1, a(3) = 2+3 = 5, a(4) = 5+8+13=26,etc.

MAPLE

with(combinat, fibonacci): A077537 := n -> fibonacci(fibonacci(n+2)+1)-fibonacci(fibonacci(n+1)+1);

CROSSREFS

Cf. A000045.

Sequence in context: A048690 A106296 A060516 this_sequence A140423 A090644 A015490

Adjacent sequences: A077534 A077535 A077536 this_sequence A077538 A077539 A077540

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Nov 08 2002

EXTENSIONS

More terms from Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Nov 17 2002

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research