|
%I #22 Sep 08 2022 08:44:46
%S 0,15,15,30,45,75,120,195,315,510,825,1335,2160,3495,5655,9150,14805,
%T 23955,38760,62715,101475,164190,265665,429855,695520,1125375,1820895,
%U 2946270,4767165,7713435,12480600,20194035,32674635,52868670,85543305,138411975,223955280,362367255,586322535,948689790,1535012325
%N Fibonacci sequence beginning 0, 15.
%H G. C. Greubel, <a href="/A022349/b022349.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.: 15*x/(1 - x - x^2). - _Philippe Deléham_, Nov 20 2008
%F From _Bruno Berselli_, Jul 27 2017: (Start)
%F a(n) = 15*A000045(n).
%F a(n) = Lucas(n+4) - Lucas(n-4), where Lucas(i) for i = 0..3 gives 7, -4, 3, -1. (End)
%t Table[15 Fibonacci[n], {n, 0, 40}] (* or *) LinearRecurrence[{1, 1}, {0, 15}, 40] (* _Bruno Berselli_, Jul 27 2017 *)
%o (Magma) a0:=0; a1:=15; [GeneralizedFibonacciNumber(a0, a1, n): n in [0..40]]; // _Bruno Berselli_, Jul 27 2017
%o (PARI) for(n=0,50, print1(15*fibonacci(n), ", ")) \\ _G. C. Greubel_, Aug 26 2017
%Y Cf. A000032, A000045.
%K nonn,easy
%O 0,2
%A _N. J. A. Sloane_
|
