Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #42 Jun 20 2022 08:35:32
%S 3,10,13,23,36,59,95,154,249,403,652,1055,1707,2762,4469,7231,11700,
%T 18931,30631,49562,80193,129755,209948,339703,549651,889354,1439005,
%U 2328359,3767364,6095723,9863087,15958810,25821897,41780707,67602604,109383311,176985915
%N Fibonacci sequence beginning 3, 10.
%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.: (3+7x)/(1-x-x^2). - _Philippe Deléham_, Nov 19 2008
%F From _Wajdi Maaloul_, Jun 09 2022: (Start)
%F a(n) = 3*Lucas(n+1) + Fibonacci(n).
%F a(n) = 3*Fibonacci(n+1) + 7*Fibonacci(n).
%F a(n) = a(n-1) + a(n-2). (End)
%t a={};b=3;c=10;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 *)
%Y Cf. A000032, A000045.
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_