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.
%I A113597 #19 Jul 01 2025 01:01:19 %S A113597 1,0,0,1,3,16,212,10713,5691941,139578159558,1779979276420851744, %T A113597 555565404222512714988011077619, %U A113597 2211236406303914545143847565520581298983941196845,2746979206949941983182302875626552882765513393050066744028390937621757948751904 %N A113597 a(n) = F(F(n+1)) - F(F(n)), where F() = Fibonacci numbers. %H A113597 Alois P. Heinz, <a href="/A113597/b113597.txt">Table of n, a(n) for n = 0..18</a> %p A113597 F:= n-> (<<0|1>, <1|1>>^n)[1, 2]: %p A113597 a:= n-> F(F(n+1)) - F(F(n)): %p A113597 seq(a(n), n=0..13); # _Alois P. Heinz_, Nov 07 2018 %o A113597 (PARI) F=fibonacci; a(n) = F(F(n+1)) - F(F(n)); \\ _Michel Marcus_, Sep 16 2013 %Y A113597 Cf. A000045. First differences of A007570. %K A113597 easy,nonn %O A113597 0,5 %A A113597 _Amarnath Murthy_, Nov 07 2005 %E A113597 Better description from _Jonathan Vos Post_, Nov 10 2005 %E A113597 Edited by _N. J. A. Sloane_, Nov 11 2005 %E A113597 a(0)=1 prepended by _Alois P. Heinz_, Nov 07 2018