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.

Showing 1-2 of 2 results.

A163063 Lucas(3n+2) = Fibonacci(3n+1) + Fibonacci(3n+3).

Original entry on oeis.org

3, 11, 47, 199, 843, 3571, 15127, 64079, 271443, 1149851, 4870847, 20633239, 87403803, 370248451, 1568397607, 6643838879, 28143753123, 119218851371, 505019158607, 2139295485799, 9062201101803, 38388099893011
Offset: 0

Views

Author

Al Hakanson (hawkuu(AT)gmail.com), Jul 20 2009

Keywords

Comments

Binomial transform of A163062. Second binomial transform of A163114. Inverse binomial transform of A098648 without initial 1.

Crossrefs

Cf. A000032, A000045, A163062, A163114, A098648, A001077 (L(3*n)/L(2)), A048876 (L(3*n+1)).

Programs

  • Magma
    Z:=PolynomialRing(Integers()); N:=NumberField(x^2-5); S:=[ ((3+r)*(2+r)^n+(3-r)*(2-r)^n)/2: n in [0..21] ]; [ Integers()!S[j]: j in [1..#S] ]; // Klaus Brockhaus, Jul 21 2009
    
  • Magma
    [Lucas(3*n+2): n in [0..30]]; // Vincenzo Librandi, Apr 18 2011
    
  • Maple
    with(combinat):A163063:=proc(n)return fibonacci(3*n+1) + fibonacci(3*n+3): end:seq(A163063(n), n=0..21); # Nathaniel Johnston, Apr 18 2011
  • Mathematica
    Table[Fibonacci[3n + 1] + Fibonacci[3n + 3], {n, 0, 21}] (* Alonso del Arte, Nov 29 2010 *)
    LinearRecurrence[{4,1},{3,11},30] (* Harvey P. Dale, Apr 14 2021 *)
  • PARI
    Vec((3-x)/(1-4*x-x^2) + O(x^100)) \\ Altug Alkan, Dec 10 2015

Formula

a(n) = 4*a(n-1)+a(n-2) for n > 1; a(0) = 3, a(1) = 11.
G.f.: (3-x)/(1-4*x-x^2).
a(n) = A033887(n) + A014445(n+1).
a(n) = ((3+sqrt(5))*(2+sqrt(5))^n+(3-sqrt(5))*(2-sqrt(5))^n)/2.
a(n) = A000032(3*n+2), n>=0, (Lucas trisection). - Wolfdieter Lang, Mar 09 2011.
a(n) = 5*F(n)*F(n+1)*L(n+1) + L(n+2)*(-1)^n with F(n)=A000045(n) and L(n)=A000032(n). - J. M. Bergot, Dec 10 2015

Extensions

Edited and extended beyond a(5) by Klaus Brockhaus, Jul 21 2009

A163114 a(n) = 5*a(n-2) for n > 2; a(1) = 3, a(2) = 5.

Original entry on oeis.org

3, 5, 15, 25, 75, 125, 375, 625, 1875, 3125, 9375, 15625, 46875, 78125, 234375, 390625, 1171875, 1953125, 5859375, 9765625, 29296875, 48828125, 146484375, 244140625, 732421875, 1220703125, 3662109375, 6103515625, 18310546875
Offset: 1

Views

Author

Klaus Brockhaus, Jul 21 2009

Keywords

Comments

Binomial transform is A163062, second binomial transform is A163063, third binomial transform is A098648 without initial 1, fourth binomial transform is A163064, fifth binomial transform is A163065.

Crossrefs

Programs

  • Magma
    [ n le 2 select 2*n+1 else 5*Self(n-2): n in [1..29] ];
    
  • Mathematica
    CoefficientList[Series[x*(3 + 5*x)/(1 - 5*x^2), {x, 0, 50}], x] (* G. C. Greubel, Dec 21 2017 *)
    LinearRecurrence[{0,5},{3,5},30] (* Harvey P. Dale, Aug 01 2021 *)
  • PARI
    x='x+O('x^30); Vec(x*(3+5*x)/(1-5*x^2)) \\ G. C. Greubel, Dec 21 2017

Formula

a(n) = (2-(-1)^n)*5^(1/4*(2*n-1+(-1)^n)).
G.f.: x*(3+5*x)/(1-5*x^2).
a(n) = A056487(n), n>=1.
E.g.f.: cosh(sqrt(5)*x) + 3*sinh(sqrt(5)*x)/sqrt(5) - 1. - Stefano Spezia, Nov 19 2023
Showing 1-2 of 2 results.