login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

Fibonacci sequence beginning 0, 13.
1

%I #25 Dec 26 2018 21:35:18

%S 0,13,13,26,39,65,104,169,273,442,715,1157,1872,3029,4901,7930,12831,

%T 20761,33592,54353,87945,142298,230243,372541,602784,975325,1578109,

%U 2553434,4131543,6684977,10816520,17501497,28318017,45819514,74137531,119957045,194094576,314051621,508146197

%N Fibonacci sequence beginning 0, 13.

%H G. C. Greubel, <a href="/A022347/b022347.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.: 13*x/(1-x-x^2). - _Philippe Deléham_, Nov 20 2008

%F a(n) = 13*Fibonacci(n). - _G. C. Greubel_, Aug 25 2017

%t a={};b=0;c=13;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 17 2008 *)

%t LinearRecurrence[{1,1},{0,13},40] (* _Harvey P. Dale_, Jan 24 2013 *)

%o (PARI) for(n=0,50, print1(13*fibonacci(n), ", ")) \\ _G. C. Greubel_, Aug 25 2017

%K nonn

%O 0,2

%A _N. J. A. Sloane_