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 A101156 #35 Jan 05 2025 19:51:37
%S A101156 10,24,34,58,92,150,242,392,634,1026,1660,2686,4346,7032,11378,18410,
%T A101156 29788,48198,77986,126184,204170,330354,534524,864878,1399402,2264280,
%U A101156 3663682,5927962,9591644,15519606,25111250,40630856,65742106,106372962,172115068
%N A101156 a(n) = 2*Fibonacci(n) + 8*Fibonacci(n-5).
%H A101156 Colin Barker, <a href="/A101156/b101156.txt">Table of n, a(n) for n = 5..1000</a>
%H A101156 H. Zhao and X. Li, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Papers1/44-1/quarthzhoa01_2006.pdf">On the Fibonacci numbers of trees</a>, Fib. Quart., 44 (2006), 32-38.
%H A101156 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1,1).
%F A101156 From _Colin Barker_, Jul 30 2013: (Start)
%F A101156 a(n) = a(n-1) + a(n-2).
%F A101156 G.f.: -2*x^5*(7*x+5) / (x^2+x-1). (End)
%p A101156 with(combinat): A101156:=n->2*fibonacci(n)+8*fibonacci(n-5): seq(A101156(n), n=5..50); # _Wesley Ivan Hurt_, Jan 23 2017
%t A101156 Table[2Fibonacci[n]+8Fibonacci[n-5],{n,5,40}] (* _Harvey P. Dale_, Jul 15 2013 *)
%t A101156 LinearRecurrence[{1, 1}, {10, 24}, 35] (* _Vincenzo Librandi_, Jan 24 2017 *)
%o A101156 (PARI) Vec(-2*x^5*(7*x+5)/(x^2+x-1) + O(x^50)) \\ _Colin Barker_, Mar 07 2016
%o A101156 (Magma) [2*Fibonacci(n)+8*Fibonacci(n-5): n in [5..40]]; // _Vincenzo Librandi_, Jan 24 2017
%K A101156 nonn,easy
%O A101156 5,1
%A A101156 _N. J. A. Sloane_, Oct 03 2007