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 A022407 #32 Jul 02 2025 16:01:55
%S A022407 3,8,12,21,34,56,91,148,240,389,630,1020,1651,2672,4324,6997,11322,
%T A022407 18320,29643,47964,77608,125573,203182,328756,531939,860696,1392636,
%U A022407 2253333,3645970,5899304,9545275,15444580,24989856,40434437,65424294
%N A022407 a(n) = a(n-1) + a(n-2) + 1, with a(0)=3, a(1)=8.
%H A022407 G. C. Greubel, <a href="/A022407/b022407.txt">Table of n, a(n) for n = 0..1000</a>
%H A022407 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (2,0,-1)
%F A022407 a(n) = Fibonacci(n-2) + Fibonacci(n+5) - 1. - _Zerinvary Lajos_, Feb 01 2008
%F A022407 From Lambert Herrgesell (zero815(AT)googlemail.com), Feb 24 2008: (Start)
%F A022407 O.g.f.: (-4*x^2 + 2*x + 3)/(x^3 - 2*x + 1).
%F A022407 a(n) = -1 - B*(2/(-1-sqrt(5)))^n - C*(2/(-1+sqrt(5)))^n, with B=(-8 - 6*sqrt(5))/(5 + 3*sqrt(5)), C=(-8 + 6*sqrt(5))/(5 - 3*sqrt(5)). (End)
%p A022407 with(combinat): seq(fibonacci(n-2)+fibonacci(n+5)-1, n=0..32); # _Zerinvary Lajos_, Feb 01 2008
%t A022407 Transpose[NestList[{#[[2]],Total[#]+1}&,{3,8},35]][[1]] (* _Harvey P. Dale_, Feb 07 2011 *)
%t A022407 Table[Fibonacci[n-2] + Fibonacci[n+5] - 1, {n,0,50}] (* _G. C. Greubel_, Mar 01 2018 *)
%o A022407 (PARI) for(n=0,30, print1(fibonacci(n-2) + fibonacci(n+5) - 1, ", ")) \\ _G. C. Greubel_, Mar 01 2018
%o A022407 (Magma) [Fibonacci(n-2) + Fibonacci(n+5) - 1: n in [0..30]]; // _G. C. Greubel_, Mar 01 2018
%K A022407 nonn
%O A022407 0,1
%A A022407 _N. J. A. Sloane_
%E A022407 More terms from _James Sellers_, Aug 08 2000