cp's OEIS Frontend

A049667 a(n) = Fibonacci(7*n)/13.

%I A049667 #62 Sep 08 2022 08:44:58
%S A049667 0,1,29,842,24447,709805,20608792,598364773,17373187209,504420793834,
%T A049667 14645576208395,425226130837289,12346203370489776,358465123875040793,
%U A049667 10407834795746672773,302185674200528551210,8773792386611074657863
%N A049667 a(n) = Fibonacci(7*n)/13.
%H A049667 G. C. Greubel, <a href="/A049667/b049667.txt">Table of n, a(n) for n = 0..650</a>
%H A049667 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A049667 Shaoxiong Yuan, <a href="https://arxiv.org/abs/1907.12459">Generalized Identities of Certain Continued Fractions</a>, arXiv:1907.12459 [math.NT], 2019.
%H A049667 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (29, 1).
%F A049667 G.f.: x/(1 - 29*x - x^2).
%F A049667 a(n) = A134498(n)/13.
%F A049667 a(n) = F(n, 29), the n-th Fibonacci polynomial evaluated at x=29. - _T. D. Noe_, Jan 19 2006
%F A049667 a(n) = 29*a(n-1) + a(n-2), n > 1; a(0)=0, a(1)=1. - _Philippe Deléham_, Nov 22 2008
%F A049667 For n >= 1, a(n) equals the denominator of the continued fraction [29, 29, ..., 29] (with n copies of 29). The numerator of that continued fraction is a(n+1). - _Greg Dresden_ and _Shaoxiong Yuan_, Jul 26 2019
%F A049667 a(n) = ((-1)^n*7*F(n) + 14*5*F(n)^3 + (-1)^n*7*5^2*F(n)^5 + 5^3*F(n)^7)/13, n >= 0. See the general D. Jennings formula given in comment on triangle A111125, where also the reference is given. Here the fourth row (k=3) applies. - _Wolfdieter Lang_, Sep 01 2012
%F A049667 G.f.: G(0)*x/(2-29*x), where G(k)= 1 + 1/(1 - (x*(845*k-841))/((x*(845*k+4)) - 58/G(k+1))); (continued fraction). - _Sergei N. Gladkovskii_, Jun 15 2013
%F A049667 O.g.f.: x*exp(Sum_{n >= 1} Lucas(7*n)*x^n/n) = x + 29*x^2 + 842*x^3 + .... - _Peter Bala_, Oct 11 2019
%p A049667 a:= n-> (<<0|1>, <1|29>>^n)[1, 2]:
%p A049667 seq(a(n), n=0..20);  # _Alois P. Heinz_, Sep 20 2017
%t A049667 Fibonacci[(7*Range[0,20])]/13 (* or *) LinearRecurrence[{29,1},{0,1},20] (* _Harvey P. Dale_, Sep 17 2017 *)
%o A049667 (MuPAD) numlib::fibonacci(7*n)/13 $ n = 0..25; // _Zerinvary Lajos_, May 09 2008
%o A049667 (Sage) [fibonacci(7*n)/13 for n in range(0, 17)] # _Zerinvary Lajos_, May 15 2009
%o A049667 (PARI) a(n)=fibonacci(7*n)/13 \\ _Charles R Greathouse IV_, Oct 07 2016
%o A049667 (Magma) [Fibonacci(7*n)/13: n in [0..30]]; // _G. C. Greubel_, Dec 02 2017
%Y A049667 A column of array A028412.
%Y A049667 Cf. A000045, A134498.
%K A049667 nonn,easy
%O A049667 0,3
%A A049667 _Clark Kimberling_