login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087130 a(n) = 5*a(n-1)+a(n-2) for n>1, a(0)=2, a(1)=5. 12

%I

%S 2,5,27,140,727,3775,19602,101785,528527,2744420,14250627,73997555,

%T 384238402,1995189565,10360186227,53796120700,279340789727,

%U 1450500069335,7531841136402,39109705751345,203080369893127

%N a(n) = 5*a(n-1)+a(n-2) for n>1, a(0)=2, a(1)=5.

%C Sequence related to the 'silver mean' [5;5,5,5,5,...].

%C The solution to the general recurrence b(n) = (2*k+1)*b(n-1)+b(n-2) with b(0)=2, b(1) = 2*k+1 is b(n) = ((2*k+1)+sqrt(4*k^2+4*k+5))^n+(2*k+1)-sqrt(4*k^2+4*k+5))^n)/2; b(n) = 2^(1-n)*Sum_{j=0..n} C(n, 2*j)*(4*k^2+4*k+5)^j*(2*k+1)^(n-2*j); b(n) = 2*T(n, (2*k+1)*x/2)(-1)^i with T(n, x) Chebyshev's polynomials of the first kind (see A053120) and i^2=-1. - _Paul Barry_, Nov 15 2003

%C Primes in this sequence include a(0) = 2; a(1) = 5; a(4) = 727; a(8) = 528527 (3) semiprimes in this sequence include a(7) = 101785; a(13) = 1995189565; a(16) = 279340789727; a(19) = 39109705751345; a(20) = 203080369893127 - _Jonathan Vos Post_, Feb 09 2005

%C a(n)^2 - 29*A052918(n-1)^2 = 4*(-1)^n, with n>0 - _Gary W. Adamson_, Oct 07 2008

%C For more information about this type of recurrence follow the Khovanova link and see A054413 and A086902. - _Johannes W. Meijer_, Jun 12 2010

%C Binomial transform of A072263. - _Johannes W. Meijer_, Aug 01 2010

%H Vincenzo Librandi, <a href="/A087130/b087130.txt">Table of n, a(n) for n = 0..1000</a>

%H P. Bhadouria, D. Jhala, B. Singh, <a href="http://www.tjmcs.com/includes/files/articles/Vol8_Iss1_81 - 92_Binomial_Transforms_of_the_k-Lucas.pdf">Binomial Transforms of the k-Lucas Sequences and its [sic] Properties</a>, The Journal of Mathematics and Computer Science (JMCS), Volume 8, Issue 1, Pages 81-92; sequence L_{5,n}.

%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>

%H <a href="/index/Rea#recur1">Index entries for recurrences a(n) = k*a(n - 1) +/- a(n - 2)</a>

%H <a href="/index/Ch#Cheby">Index entries for sequences related to Chebyshev polynomials.</a>

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (5,1).

%F a(n) = ((5+sqrt(29))/2)^n+((5-sqrt(29))/2)^n.

%F a(n) = A100236(n) + 1.

%F E.g.f. : 2*exp(5*x/2)*cosh(sqrt(29)*x/2); a(n) = 2^(1-n)*Sum_{k=0..floor(n/2)} C(n, 2k)*29^k*5^(n-2*k). a(n) = 2T(n, 5i/2)(-i)^n with T(n, x) Chebyshev's polynomials of the first kind (see A053120) and i^2=-1. - _Paul Barry_, Nov 15 2003

%F O.g.f.: (-2+5*x)/(-1+5*x+x^2). - _R. J. Mathar_, Dec 02 2007

%F a(-n) = (-1)^n * a(n). - _Michael Somos_, Nov 01 2008

%F A090248(n) = a(2*n). 5 * A097834(n) = a(2*n + 1). - _Michael Somos_, Nov 01 2008

%F Limit(a(n+k)/a(k), k=infinity) = (A087130(n) + A052918(n-1)*sqrt(29))/2. Limit(A087130(n)/A052918(n-1), n= infinity) = sqrt(29). - _Johannes W. Meijer_, Jun 12 2010

%F a(3n+1) = A041046(5n), a(3n+2) = A041046(5n+3) and a(3n+3) = 2*A041046 (5n+4). - _Johannes W. Meijer_, Jun 12 2010

%t RecurrenceTable[{a[0] == 2, a[1] == 5, a[n] == 5 a[n-1] + a[n-2]}, a, {n, 30}] (* _Vincenzo Librandi_, Sep 19 2016 *)

%o (PARI) {a(n) = if( n<0, (-1)^n * a(-n), polsym(x^2 - 5*x -1, n) [n + 1])} /* _Michael Somos_, Nov 04 2008 */

%o (Sage) [lucas_number2(n,5,-1) for n in xrange(0, 21)] # _Zerinvary Lajos_, May 14 2009

%o (MAGMA) I:=[2,5]; [n le 2 select I[n] else 5*Self(n-1)+Self(n-2): n in [1..30]]; // _Vincenzo Librandi_, Sep 19 2016

%Y Cf. A006497, A014448, A085447.

%Y Cf. A086902, A000032.

%Y Cf. A052918. [From _Gary W. Adamson_, Oct 07 2008]

%K nonn,easy

%O 0,1

%A _Paul Barry_, Aug 16 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified February 22 03:55 EST 2018. Contains 299428 sequences. (Running on oeis4.)