|
%I #21 Aug 26 2017 20:10:15
%S 0,31,31,62,93,155,248,403,651,1054,1705,2759,4464,7223,11687,18910,
%T 30597,49507,80104,129611,209715,339326,549041,888367,1437408,2325775,
%U 3763183,6088958,9852141,15941099
%N Fibonacci sequence beginning 0, 31.
%H Harvey P. Dale, <a href="/A022365/b022365.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.: 31*x/(1-x-x^2). - _Philippe Deléham_, Nov 20 2008
%F a(n) = 31*A000045(n). - _G. C. Greubel_, Aug 26 2017
%t a={};b=0;c=31;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 LinearRecurrence[{1,1},{0,31},30] (* _Harvey P. Dale_, May 30 2013 *)
%o (PARI) for(n=0,50, print1(31*fibonacci(n), ", ")) \\ _G. C. Greubel_, Aug 26 2017
%K nonn
%O 0,2
%A _N. J. A. Sloane_
|
