cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A077537 Sum of next F(n) Fibonacci numbers, where F(n) = n-th Fibonacci number.

This page as a plain text file.
%I A077537 #7 Nov 05 2015 11:38:01
%S A077537 0,1,1,5,26,343,17334,9209754,225842206252,2880066968519382403,
%T A077537 898923707005599922079920034025,
%U A077537 3577855662560905980740035806138759999587547050967,4444705723234237498833973519979330664270869912654770206838250657106420149314752
%N A077537 Sum of next F(n) Fibonacci numbers, where F(n) = n-th Fibonacci number.
%H A077537 Alois P. Heinz, <a href="/A077537/b077537.txt">Table of n, a(n) for n = 0..17</a>
%F A077537 First differences of A005370 = F(F(n+1)+1). - Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Nov 17 2002
%e A077537 a(0) =0, a(1) = 1, a(2) = 1, a(3) = 2+3 = 5, a(4) = 5+8+13=26, etc.
%p A077537 with(combinat, fibonacci): A077537 := n -> fibonacci(fibonacci(n+2)+1)-fibonacci(fibonacci(n+1)+1);
%p A077537 # second Maple program:
%p A077537 F:= n-> (<<0|1>, <1|1>>^n)[1, 2]:
%p A077537 a:= n-> F(F(n+2)+1)-F(F(n+1)+1):
%p A077537 seq(a(n), n=0..14);  # _Alois P. Heinz_, Nov 05 2015
%Y A077537 Cf. A000045.
%K A077537 nonn
%O A077537 0,4
%A A077537 _Amarnath Murthy_, Nov 08 2002
%E A077537 More terms from Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Nov 17 2002