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 A155110 #18 Sep 08 2022 08:45:40 %S A155110 8,16,40,104,272,712,1864,4880,12776,33448,87568,229256,600200, %T A155110 1571344,4113832,10770152,28196624,73819720,193262536,505967888, %U A155110 1324641128,3467955496,9079225360,23769720584,62229936392,162920088592,426530329384,1116670899560 %N A155110 a(n) = 8*Fibonacci(2n+1). %H A155110 Vincenzo Librandi, <a href="/A155110/b155110.txt">Table of n, a(n) for n = 0..200</a> %H A155110 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (3,-1). %F A155110 a(n) = 8*A001519(n+1) = 8*A122367(n) = 8 *|A099496(n)|. %F A155110 a(n) == A154811(n+6) (mod 9). %F A155110 a(n) == A156551(n) (mod 10). %F A155110 a(n) = A153873(n) - A027941(n). %F A155110 G.f.: 8*(1 - x)/(1 - 3*x + x^2). - _G. C. Greubel_, Apr 21 2021 %p A155110 A155110 := proc(n) 8*combinat[fibonacci](2*n+1) ; end: seq(A155110(n),n=0..50) ; # _R. J. Mathar_, Oct 06 2009 %t A155110 8*Fibonacci[2*Range[0,30]+1] (* _G. C. Greubel_, Apr 21 2021 *) %o A155110 (Magma) [8*Fibonacci(2*n+1): n in [0..30]]; // _Vincenzo Librandi_, Aug 07 2011 %o A155110 (Sage) [8*fibonacci(2*n+1) for n in (0..30)] # _G. C. Greubel_, Apr 21 2021 %Y A155110 Cf. A001519, A027941, A099496, A122367, A153873, A154811, A156551. %K A155110 nonn,easy,less %O A155110 0,1 %A A155110 _Paul Curtz_, Jan 20 2009 %E A155110 Comments converted to formulas by _R. J. Mathar_, Oct 06 2009