|
%I #18 Sep 08 2022 08:44:46
%S 4,22,26,48,74,122,196,318,514,832,1346,2178,3524,5702,9226,14928,
%T 24154,39082,63236,102318,165554,267872,433426,701298,1134724,1836022,
%U 2970746,4806768,7777514,12584282,20361796,32946078,53307874,86253952,139561826,225815778,365377604,591193382
%N Fibonacci sequence beginning 4, 22.
%H G. C. Greubel, <a href="/A022385/b022385.txt">Table of n, a(n) for n = 0..1000</a>
%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1, 1).
%F G.f.: (4+18x)/(1-x-x^2). - _Philippe Deléham_, Nov 19 2008
%F a(n) = 4*Fibonacci(n+2) + 14*Fibonacci(n) = 4*Fibonacci(n-1) + 22*Fibonacci(n). - _G. C. Greubel_, Mar 02 2018
%t Table[4*Fibonacci[n+2] + 14*Fibonacci[n], {n, 0, 50}] (* or *) LinearRecurrence[{1,1}, {4,22}, 50] (* _G. C. Greubel_, Mar 02 2018 *)
%o (PARI) for(n=0, 50, print1(4*fibonacci(n+2) + 14*fibonacci(n), ", ")) \\ _G. C. Greubel_, Mar 02 2018
%o (Magma) [4*Fibonacci(n+2) + 14*Fibonacci(n): n in [0..50]]; // _G. C. Greubel_, Mar 02 2018
%K nonn
%O 0,1
%A _N. J. A. Sloane_
%E Terms a(30) onward added by _G. C. Greubel_, Mar 02 2018
|
