cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A084328 a(0)=0, a(1)=1; a(n) = 13*a(n-1) - 11*a(n-2).

This page as a plain text file.
%I A084328 #32 Jan 01 2024 11:18:05
%S A084328 0,1,13,158,1911,23105,279344,3377317,40832337,493669894,5968552915,
%T A084328 72160819061,872436565728,10547906344793,127525980259301,
%U A084328 1541810773578190,18640754273664159,225369887048273977
%N A084328 a(0)=0, a(1)=1; a(n) = 13*a(n-1) - 11*a(n-2).
%H A084328 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (13,-11).
%F A084328 a(n) = (1/5)*Sum_{k=0..n} binomial(n, k)*F(5*k) where F(k) denotes the k-th Fibonacci number.
%F A084328 G.f.: x / (11*x^2-13*x+1). - _Colin Barker_, Jun 26 2013
%t A084328 Join[{a=0,b=1},Table[c=13*b-11*a;a=b;b=c,{n,60}]] (* _Vladimir Joseph Stephan Orlovsky_, Jan 21 2011 *)
%o A084328 (PARI) a(n)=(1/5)*sum(k=0,n,binomial(n,k)*fibonacci(5*k));
%o A084328 (Sage) [lucas_number1(n,13,11) for n in range(0, 18)] # _Zerinvary Lajos_, Apr 29 2009
%Y A084328 Cf. A030191.
%K A084328 nonn,easy
%O A084328 0,3
%A A084328 _Benoit Cloitre_, Jun 21 2003