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 A022369 #26 Jun 29 2025 18:28:01
%S A022369 2,14,16,30,46,76,122,198,320,518,838,1356,2194,3550,5744,9294,15038,
%T A022369 24332,39370,63702,103072,166774,269846,436620,706466,1143086,1849552,
%U A022369 2992638,4842190,7834828,12677018
%N A022369 Fibonacci sequence beginning 2, 14.
%H A022369 G. C. Greubel, <a href="/A022369/b022369.txt">Table of n, a(n) for n = 0..1000</a>
%H A022369 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A022369 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1, 1).
%F A022369 G.f.: (2+12*x)/(1-x-x^2). - _Philippe Deléham_, Nov 19 2008
%F A022369 a(n) = 2*(Fibonacci(n+2) + 5*Fibonacci(n)). - _G. C. Greubel_, Aug 27 2017
%F A022369 a(n) = 2 * A022097(n). - _Alois P. Heinz_, Aug 27 2017
%t A022369 a={};b=2;c=14;AppendTo[a, b];AppendTo[a, c];Do[b=b+c;AppendTo[a, b];c=b+c;AppendTo[a, c], {n, 4!}];a (* _Vladimir Joseph Stephan Orlovsky_, Sep 18 2008 *)
%t A022369 Transpose[NestList[{Last[#],Total[#]}&,{2,14},40]][[1]] (* _Harvey P. Dale_, Apr 13 2011 *)
%t A022369 LinearRecurrence[{1,1},{2,14},40] (* _Harvey P. Dale_, Oct 05 2019 *)
%o A022369 (PARI) for(n=0,50, print1(2*(Fibonacci(n+2) + 5*Fibonacci(n)), ", ")) \\ _G. C. Greubel_, Aug 27 2017
%Y A022369 Cf. A022097.
%K A022369 nonn
%O A022369 0,1
%A A022369 _N. J. A. Sloane_