|
%I #36 Jul 20 2017 12:11:58
%S 2,11,13,24,37,61,98,159,257,416,673,1089,1762,2851,4613,7464,12077,
%T 19541,31618,51159,82777,133936,216713,350649,567362,918011,1485373,
%U 2403384,3888757,6292141,10180898,16473039,26653937,43126976,69780913,112907889,182688802
%N Fibonacci sequence beginning 2, 11.
%H Ivan Panchenko, <a href="/A022115/b022115.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 Clark Kimberling, <a href="http://www.fq.math.ca/Papers1/52-5/Problems.pdf">Problem Proposals</a>, The Fibonacci Quarterly, vol. 52 #5, 2015, p5-14.
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1,1).
%F G.f.: (2+9*x)/(1-x-x^2). - _Philippe Deléham_, Nov 19 2008
%F a(n) = 12*F(n) + F(n-3). - _J. M. Bergot_, Jul 20 2017
%t CoefficientList[Series[(2 + 9 x)/(1 - x - x^2), {x, 0, 40}], x] (* _Wesley Ivan Hurt_, Jun 15 2014 *)
%Y Cf. A000032.
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_, Jun 14 1998
|
