This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A113597 a(n) = F(F(n+1)) - F(F(n)), where F() = Fibonacci numbers. 1

%I

%S 1,0,0,1,3,16,212,10713,5691941,139578159558,1779979276420851744,

%T 555565404222512714988011077619,

%U 2211236406303914545143847565520581298983941196845,2746979206949941983182302875626552882765513393050066744028390937621757948751904

%N a(n) = F(F(n+1)) - F(F(n)), where F() = Fibonacci numbers.

%H Alois P. Heinz, <a href="/A113597/b113597.txt">Table of n, a(n) for n = 0..18</a>

%p F:= n-> (<<0|1>, <1|1>>^n)[1, 2]:

%p a:= n-> F(F(n+1)) - F(F(n)):

%p seq(a(n), n=0..13); # _Alois P. Heinz_, Nov 07 2018

%o (PARI) F=fibonacci; a(n) = F(F(n+1)) - F(F(n)); \\ _Michel Marcus_, Sep 16 2013

%Y Cf. A000045. First differences of A007570.

%K easy,nonn

%O 0,5

%A _Amarnath Murthy_, Nov 07 2005

%E Better description from _Jonathan Vos Post_, Nov 10 2005

%E Edited by _N. J. A. Sloane_, Nov 11, 2005

%E a(0)=1 prepended by _Alois P. Heinz_, Nov 07 2018

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.

Last modified May 20 20:16 EDT 2019. Contains 323426 sequences. (Running on oeis4.)