A090017 -id:A090017 - cp's OEIS frontend

A135030 Generalized Fibonacci numbers: a(n) = 6a(n-1) + 2a(n-2).

0, 1, 6, 38, 240, 1516, 9576, 60488, 382080, 2413456, 15244896, 96296288, 608267520, 3842197696, 24269721216, 153302722688, 968355778560, 6116740116736, 38637152257536, 244056393778688, 1541612667187200

Offset: 0

Rolf Pleisch, Feb 10 2008, Feb 14 2008

For n>0, a(n) equals the number of words of length n-1 over {0,1,...,7} in which 0 and 1 avoid runs of odd lengths. - Milan Janjic, Jan 08 2017

Joshua Zucker and Robert Israel, Table of n, a(n) for n = 0..1000 (n=0..51 from Joshua Zucker).
Index entries for linear recurrences with constant coefficients, signature (6, 2).

Cf. A001076, A006190, A007482, A015520, A015521, A015523, A015524, A015525, A015528, A015529, A015530, A015531, A015532, A015533, A015534, A015535, A015536, A015537, A015440, A015441, A015443, A015444, A015445, A015447, A015548, A030195, A053404, A057087, A057088, A083858, A085939, A090017, A091914, A099012, A180222, A180226, A180250.

[n le 2 select n-1 else 6*Self(n-1) + 2*Self(n-2): n in [1..35]]; // Vincenzo Librandi, Sep 18 2016

A:= gfun:-rectoproc({a(0) = 0, a(1) = 1, a(n) = 2*(3*a(n-1) + a(n-2))},a(n),remember):
seq(A(n),n=1..30); # Robert Israel, Sep 16 2014

Join[{a=0,b=1},Table[c=6*b+2*a;a=b;b=c,{n,100}]] (* Vladimir Joseph Stephan Orlovsky, Jan 16 2011 *)
LinearRecurrence[{6,2},{0,1},30] (* or *) CoefficientList[Series[ -(x/(2x^2+6x-1)),{x,0,30}],x] (* Harvey P. Dale, Jun 20 2011 *)

a(n)=([0,1; 2,6]^n*[0;1])[1,1] \\ Charles R Greathouse IV, Oct 03 2016

[lucas_number1(n,6,-2) for n in range(0, 21)] # Zerinvary Lajos, Apr 24 2009

a(0) = 0; a(1) = 1; a(n) = 2*(3*a(n-1) + a(n-2)).
a(n) = 1/(2*sqrt(11))*( (3 + sqrt(11))^n - (3 - sqrt(11))^n ).
G.f.: x/(1 - 6*x - 2*x^2). - Harvey P. Dale, Jun 20 2011
a(n+1) = Sum_{k=0..n} A099097(n,k)*2^k. - Philippe Deléham, Sep 16 2014
E.g.f.: (1/sqrt(11))*exp(3*x)*sinh(sqrt(11)*x). - G. C. Greubel, Sep 17 2016

More terms from Joshua Zucker, Feb 23 2008

A084059 a(n) = 4a(n-1) + 2a(n-2) for n>1, a(0)=1, a(1)=2.

Original entry on oeis.org

1, 2, 10, 44, 196, 872, 3880, 17264, 76816, 341792, 1520800, 6766784, 30108736, 133968512, 596091520, 2652303104, 11801395456, 52510188032, 233643543040, 1039594548224, 4625665278976, 20581850212352, 91578731407360

Offset: 0

Paul Barry, May 10 2003

2*A084059 is the Lucas sequence V(4,-2). - Bruno Berselli, Jan 09 2013

G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (4,2).

Cf. A090017, A084120 (binomial transform), A002533 (inverse binomial transform).

a:=[1,2];; for n in [3..30] do a[n]:=4*a[n-1]+2*a[n-2]; od; a; # G. C. Greubel, Jan 03 2020

[n le 2 select n else 4*Self(n-1)+2*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Apr 05 2011

seq(simplify(2^(n/2)*(-I)^n*ChebyshevT(n, I*sqrt(2))), n = 0..30); # G. C. Greubel, Jan 03 2020

Table[(-I)^n*2^(n/2)*ChebyshevT[n, I*Sqrt[2]], {n,0,30}] (* G. C. Greubel, Jan 03 2020 *)

Vec((1-2*x)/(1-4*x-2*x^2) + O(x^30)) \\ Michel Marcus, Feb 04 2016

vector(31, n, round((-I)^(n-1)*2^((n-1)/2)*polchebyshev(n-1, 1, I*sqrt(2))) ) \\ G. C. Greubel, Jan 03 2020

[lucas_number2(n,4,-2)/2 for n in range(0, 30)] # Zerinvary Lajos, May 14 2009

E.g.f.: exp(2*x)*cosh(sqrt(6)*x).
a(n) = ((2+sqrt(6))^n + (2-sqrt(6))^n)/2. - Paul Barry, May 13 2003
a(n) = Sum_{k=0..floor(n/2)} C(n,2k)*2^(n-k)*3^k. - Paul Barry, Jan 15 2007
G.f.: (1-2*x)/(1-4*x-2*x^2). - Philippe Deléham, Sep 07 2009
a(n) = A090017(n+1) - 2*A090017(n). - R. J. Mathar, Apr 05 2011
a(n) = Sum_{k=0..n} A201730(n,k)*5^k. - Philippe Deléham, Dec 06 2011
G.f.: G(0)/2, where G(k)= 1 + 1/(1 - x*(3*k-2)/(x*(3*k+1) - 1/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, May 27 2013
a(n) = (-i)^n*2^(n/2)*ChebyshevT(n, i*sqrt(2)) = 2^((n-2)/2)*Lucas(n, 2*sqrt(2)). - G. C. Greubel, Jan 03 2020

A164549 a(n) = 4a(n-1) + 2a(n-2) for n > 1; a(0) = 1, a(1) = 6.

Original entry on oeis.org

1, 6, 26, 116, 516, 2296, 10216, 45456, 202256, 899936, 4004256, 17816896, 79276096, 352738176, 1569504896, 6983495936, 31072993536, 138258966016, 615181851136, 2737245336576, 12179345048576, 54191870867456

Offset: 0

Klaus Brockhaus, Aug 15 2009

nonn

Binomial transform of A123011. Inverse binomial transform of A164550.
INVERT transform of the sequence (1, 5, 5*3, 5*3^2, 5*3^3, 5*3^4, ...); i.e., of (1, 5, 15, 45, 135, 405, ...). The sequence can also be obtained by extracting the upper left terms in matrix powers of [(1,5); (1,3)]. - Gary W. Adamson, Jul 31 2016
The sequence is A090017 (1, 4, 18, 80, 356, ...) convolved with (1, 2, 0, 0, 0, ...). Also, the upper left terms extracted from matrix powers of [(1,5); (1,3)]. - Gary W. Adamson, Aug 20 2016

Harvey P. Dale, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (4,2).

Cf. A123011, A164550.

Cf. A084057, A108306.

[ n le 2 select 5*n-4 else 4*Self(n-1)+2*Self(n-2): n in [1..22] ];

LinearRecurrence[{4,2},{1,6},30] (* Harvey P. Dale, Mar 16 2013 *)
CoefficientList[Series[(1 +2x)/(1 -4x -2x^2), {x, 0, 24}], x] (* Michael De Vlieger, Aug 02 2016 *)

Vec((1+2*x)/(1-4*x-2*x^2) + O(x^30)) \\ Michel Marcus, Feb 04 2016

[(i*sqrt(2))^n*(chebyshev_U(n, -i*sqrt(2)) - sqrt(2)*i*chebyshev_U(n-1, -i*sqrt(2))) for n in (0..30)] # G. C. Greubel, Jul 16 2021

a(n) = ((3+2*sqrt(6))*(2+sqrt(6))^n + (3-2*sqrt(6))*(2-sqrt(6))^n)/6.
G.f.: (1+2*x)/(1-4*x-2*x^2).
a(n) = (i*sqrt(2))^n*(ChebyshevU(n, -i*sqrt(2)) - sqrt(2)*i*ChebyshevU(n-1, -i*sqrt(2))). - G. C. Greubel, Jul 16 2021

A180250 a(n) = 5a(n-1) + 10a(n-2), with a(1)=0 and a(2)=1.

Original entry on oeis.org

0, 1, 5, 35, 225, 1475, 9625, 62875, 410625, 2681875, 17515625, 114396875, 747140625, 4879671875, 31869765625, 208145546875, 1359425390625, 8878582421875, 57987166015625, 378721654296875, 2473479931640625, 16154616201171875, 105507880322265625

Offset: 1

Vladimir Joseph Stephan Orlovsky, Jan 16 2011

Nathaniel Johnston, Table of n, a(n) for n = 1..500
Index entries for linear recurrences with constant coefficients, signature (5,10).

Cf. A001076, A006190, A007482, A015520, A015521, A015523, A015524, A015525, A015528, A015529, A015530, A015531, A015532, A015533, A015534, A015535, A015536, A015537, A015440, A015441, A015443, A015444, A015445, A015447, A030195, A053404, A057087, A057088, A083858, A085939, A090017, A091914, A099012, A180222, A180226.

[n le 2 select n-1 else 5*Self(n-1) +10*Self(n-2): n in [1..30]]; // G. C. Greubel, Jan 16 2018

Join[{a=0,b=1},Table[c=5*b+10*a;a=b;b=c,{n,100}]]
LinearRecurrence[{5,10}, {0,1}, 30] (* G. C. Greubel, Jan 16 2018 *)

a(n)=([0,1;10,5]^(n-1))[1,2] \\ Charles R Greathouse IV, Oct 03 2016

my(x='x+O('x^30)); concat([0], Vec(x^2/(1-5*x-10*x^2))) \\ G. C. Greubel, Jan 16 2018

A180250= BinaryRecurrenceSequence(5,10,0,1)
[A180250(n-1) for n in range(1,41)] # G. C. Greubel, Jul 21 2023

a(n) = ((5+sqrt(65))^(n-1) - (5-sqrt(65))^(n-1))/(2^(n-1)*sqrt(65)). - Rolf Pleisch, May 14 2011
G.f.: x^2/(1-5*x-10*x^2).
a(n) = (i*sqrt(10))^(n-1) * ChebyshevU(n-1, -i*sqrt(5/8)). - G. C. Greubel, Jul 21 2023

A015551 Expansion of x/(1 - 6x - 5x^2).

Original entry on oeis.org

0, 1, 6, 41, 276, 1861, 12546, 84581, 570216, 3844201, 25916286, 174718721, 1177893756, 7940956141, 53535205626, 360916014461, 2433172114896, 16403612761681, 110587537144566, 745543286675801, 5026197405777636

Offset: 0

Olivier Gérard

Let the generator matrix for the ternary Golay G_12 code be [I|B], where the elements of B are taken from the set {0,1,2}. Then a(n)=(B^n)1,2 for instance. - _Paul Barry, Feb 13 2004

Pisano period lengths: 1, 2, 4, 4, 1, 4, 42, 8, 12, 2, 10, 4, 12, 42, 4, 16, 96, 12, 360, 4, ... - R. J. Mathar, Aug 10 2012

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Lucyna Trojnar-Spelina, Iwona Włoch, On Generalized Pell and Pell-Lucas Numbers, Iranian Journal of Science and Technology, Transactions A: Science (2019), 1-7.
Index entries for linear recurrences with constant coefficients, signature (6,5).

Cf. A001076, A006190, A007482, A015520, A015521, A015523, A015524, A015525, A015528, A015529, A015530, A015531, A015532, A015533, A015534, A015535, A015536, A015537, A015440, A015441, A015443, A015444, A015445, A015447, A015548, A030195, A053404, A057087, A057088, A057089, A083858, A085939, A090017, A091914, A099012, A135030, A135032, A180222, A180226, A180250.

I:=[0,1]; [n le 2 select I[n] else 6*Self(n-1)+5*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Nov 14 2011

Join[{a=0,b=1},Table[c=6*b+5*a;a=b;b=c,{n,100}]] (* Vladimir Joseph Stephan Orlovsky, Jan 16 2011 *)
CoefficientList[Series[x/(1-6x-5x^2),{x,0,20}],x] (* or *) LinearRecurrence[ {6,5},{0,1},30] (* Harvey P. Dale, Oct 30 2017 *)

a(n)=([0,1; 5,6]^n*[0;1])[1,1] \\ Charles R Greathouse IV, Oct 03 2016

[lucas_number1(n,6,-5) for n in range(0, 21)] # Zerinvary Lajos, Apr 24 2009

a(n) = 6*a(n-1) + 5*a(n-2).

a(n) = sqrt(14)*(3+sqrt(14))^n/28 - sqrt(14)*(3-sqrt(14))^n/28. - Paul Barry, Feb 13 2004

A368152 Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 3x, p(n,x) = up(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 3 - x^2.

Original entry on oeis.org

1, 1, 3, 4, 6, 8, 7, 27, 25, 21, 19, 66, 126, 90, 55, 40, 204, 392, 504, 300, 144, 97, 522, 1363, 1884, 1851, 954, 377, 217, 1425, 4065, 7281, 8011, 6435, 2939, 987, 508, 3642, 12332, 24606, 34044, 31446, 21524, 8850, 2584, 1159, 9441, 35236, 82020, 127830

Offset: 1

Clark Kimberling, Jan 20 2024

Because (p(n,x)) is a strong divisibility sequence, for each integer k, the sequence (p(n,k)) is a strong divisibility sequence of integers.

			First eight rows:
    1
    1    3
    4    6    8
    7   27   25   21
   19   66  126   90   55
   40  204  392  504  300  144
   97  522 1363 1884 1851  954  377
  217 1425 4065 7281 8011 6435 2939 987
Row 4 represents the polynomial p(4,x) = 7 + 27*x + 25*x^2 + 21*x^3, so (T(4,k)) = (7,27,25,21), k=0..3.

Rigoberto Flórez, Robinson Higuita, and Antara Mukherjee, Characterization of the strong divisibility property for generalized Fibonacci polynomials, Integers, 18 (2018), 1-28, Paper No. A14.

Cf. A006130 (column 1); A001906 (p(n,n-1)); A090017 (row sums), (p(n,1)); A002605 (alternating row sums), (p(n,-1)); A004187, (p(n,2)); A004254, (p(n,-2)); A190988, (p(n,3)); A190978 (unsigned), (p(n,-3)); A094440, A367208, A367209, A367210, A367211, A367297, A367298, A367299, A367300, A367301, A368150, A368151.

p[1, x_] := 1; p[2, x_] := 1 + 3 x; u[x_] := p[2, x]; v[x_] := 3 - x^2;
p[n_, x_] := Expand[u[x]*p[n - 1, x] + v[x]*p[n - 2, x]]
Grid[Table[CoefficientList[p[n, x], x], {n, 1, 10}]]
Flatten[Table[CoefficientList[p[n, x], x], {n, 1, 10}]]

p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where p(1,x) = 1, p(2,x) = 1 + 3*x, u = p(2,x), and v = 3 - x^2.

p(n,x) = k*(b^n - c^n), where k = -1/sqrt(13 + 6*x + 5*x^2), b = (1/2)*(3*x + 1 - 1/k), c = (1/2)*(3*x + 1 + 1/k).

A107979 a(n) = 4a(n-1) + 2a(n-2) for n>1, with a(0)=2, a(1)=9.

Original entry on oeis.org

2, 9, 40, 178, 792, 3524, 15680, 69768, 310432, 1381264, 6145920, 27346208, 121676672, 541399104, 2408949760, 10718597248, 47692288512, 212206348544, 944209971200, 4201252581888, 18693430269952, 83176226243584

Offset: 0

Emeric Deutsch, Jun 12 2005

Kekulé numbers for certain benzenoids.

This is the case r=2 of the generalized Pell numbers as defined in Bród. - Michel Marcus, Oct 28 2020

			G.f. = 2 + 9*x + 40*x^2 + 178*x^3 + 792*x^4 + 3524*x^5 + 15680*x^6 + 69768*x^7 + ...

S. J. Cyvin and I. Gutman, Kekulé structures in benzenoid hydrocarbons, Lecture Notes in Chemistry, No. 46, Springer, New York, 1988 (p. 78).

Dorota Bród, On a New One Parameter Generalization of Pell Numbers, Annales Mathematicae Silesianae 33 (2019), 66-76.
Index entries for linear recurrences with constant coefficients, signature (4,2).

Cf. A021001. - R. J. Mathar, Aug 24 2008

Cf. A000129, A090017.

a[0]:=2: a[1]:=9: for n from 2 to 26 do a[n]:=4*a[n-1]+2*a[n-2] od: seq(a[n],n=0..26);

LinearRecurrence[{4,2},{2,9},30] (* or *) CoefficientList[Series[(-x-2)/(2x^2+4x-1),{x,0,30}],x] (* Harvey P. Dale, Jun 21 2011 *)
a[ n_] := With[{m = n + 2}, If[ m < 0, -(-2)^m, 1] SeriesCoefficient[ x / (2 - 8 x - 4 x^2), {x, 0, Abs@m}]]; (* Michael Somos, May 23 2014 *)
a[ n_] := With[{m = n + 2, r = Sqrt[6]}, If[ m < 0, -(-2)^m, Sign@m] Expand[(2 + r)^(Abs@m) / (2 r)][[1]]]; (* Michael Somos, May 23 2014 *)

{a(n) = my(m = n+2); if( m<0, -(-2)^m, 1) * polcoeff( x / (2 - 8*x - 4*x^2) + x * O(x^abs(m)), abs(m))}; /* Michael Somos, May 23 2014 */

{a(n) = my(r = 2 + quadgen(24)); imag( (1 + 2*r) * r^n)}; /* Michael Somos, May 23 2014 */

a(n)=([0,1; 2,4]^n*[2;9])[1,1] \\ Charles R Greathouse IV, Feb 07 2017

From R. J. Mathar, Aug 24 2008: (Start)
O.g.f.: (2+x)/(1-4x-2x^2).
a(n) = 2*A090017(n) + A090017(n-1). (End)
a(n) = 1/12*((sqrt(6)-3)(-(2-sqrt(6))^n) + (3+sqrt(6))(2+sqrt(6))^n). - Harvey P. Dale, Jun 21 2011
a(n) = A000129(n+2) + Sum_{k=1..n} A000129(k+1)*a(n-k). - Ralf Stephan, May 23 2014

A189800 a(n) = 6a(n-1) + 8a(n-2), with a(0)=0, a(1)=1.

Original entry on oeis.org

0, 1, 6, 44, 312, 2224, 15840, 112832, 803712, 5724928, 40779264, 290475008, 2069084160, 14738305024, 104982503424, 747801460736, 5326668791808, 37942424436736, 270267896954880, 1925146777223168, 13713023838978048, 97679317251653632, 695780094221746176

Offset: 0

Vladimir Joseph Stephan Orlovsky, May 24 2011

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (6,8).

Sequences of the form a(n) = c*a(n-1) + d*a(n-2), with a(0)=0, a(1)=1:
c/d...1.......2.......3.......4.......5.......6.......7.......8.......9......10
.A000045,A001045,A006130,A006131,A015440,A015441,A015442,A015443,A015445,A015446
.A000129,A002605,A015518,A063727,A002532,A083099,A015519,A003683,A002534,A083102
.A006190,A007482,A030195,A015521,A015523,A083858,A015524,A015525,A099012,A015528
.A001076,A090017,A015530,A057087,A015531,A085939,A015532,A180222,A015533,A180226
.A052918,A015535,A015536,A015537,A057088,A015540,A015541,A015544,A015545,A180250
.A005668,A135030,A090018,A135032,A015551,A057089,A015552,A189800,A189801,A190005
.A054413,A015555,A015559,A015561,A015562,A015564,A057090,A015565,A015566,A015568
.A041025,A190331,A015574,A190510,A015575,A190560,A015576,A057091,A015577,A190953
.A099371,A015579,A181353,A015580,A015581,A153191,A015583,A015584,A057092,A015585
A041041,A191014,A015588,A190954,A190955,A190956,A015589,A190957,A015591,A057093

I:=[0,1]; [n le 2 select I[n] else 6*Self(n-1)+8*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Nov 14 2011

LinearRecurrence[{6, 8}, {0, 1}, 50]
CoefficientList[Series[-(x/(-1+6 x+8 x^2)),{x,0,50}],x] (* Harvey P. Dale, Jul 26 2011 *)

a(n)=([0,1; 8,6]^n*[0;1])[1,1] \\ Charles R Greathouse IV, Oct 03 2016

G.f.: x/(1 - 2*x*(3+4*x)). - Harvey P. Dale, Jul 26 2011

A342134 Square array T(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of g.f. 1/(1 - 2kx - k*x^2).

Original entry on oeis.org

1, 1, 0, 1, 2, 0, 1, 4, 5, 0, 1, 6, 18, 12, 0, 1, 8, 39, 80, 29, 0, 1, 10, 68, 252, 356, 70, 0, 1, 12, 105, 576, 1629, 1584, 169, 0, 1, 14, 150, 1100, 4880, 10530, 7048, 408, 0, 1, 16, 203, 1872, 11525, 41344, 68067, 31360, 985, 0, 1, 18, 264, 2940, 23364, 120750, 350272, 439992, 139536, 2378, 0

Offset: 0

Seiichi Manyama, Mar 01 2021

			Square array begins:
  1,  1,    1,     1,     1,      1, ...
  0,  2,    4,     6,     8,     10, ...
  0,  5,   18,    39,    68,    105, ...
  0, 12,   80,   252,   576,   1100, ...
  0, 29,  356,  1629,  4880,  11525, ...
  0, 70, 1584, 10530, 41344, 120750, ...

Seiichi Manyama, Antidiagonals n = 0..139, flattened
Index entries for sequences related to Chebyshev polynomials.

Columns 0..5 give A000007, A000129(n+1), A090017(n+1), A090018, A190510(n+1), A190955(n+1).
Rows 0..2 give A000012, A005843, A007742.
Main diagonal gives A109517(n+1).
Cf. A342120, A342129, A342133.

T:= (n, k)-> (<<0|1>, >^(n+1))[1, 2]:
seq(seq(T(n, d-n), n=0..d), d=0..12); # Alois P. Heinz, Mar 01 2021

T[n_, k_] := Sum[If[k == j == 0, 1, (2*k)^j] * 2^(j - n) * Binomial[j, n - j], {j, 0, n}]; Table[T[k, n - k], {n, 0, 10}, {k, 0, n}] // Flatten (* Amiram Eldar, Apr 27 2021 *)

T(n, k) = sum(j=0, n\2, (2*k)^(n-j)*2^(-j)*binomial(n-j, j));

T(n, k) = sum(j=0, n, (2*k)^j*2^(j-n)*binomial(j, n-j));

T(n, k) = round((-sqrt(k)*I)^n*polchebyshev(n, 2, sqrt(k)*I));

T(0,k) = 1, T(1,k) = 2*k and T(n,k) = k*(2*T(n-1,k) + T(n-2,k)) for n > 1.
T(n,k) = Sum_{j=0..floor(n/2)} (2*k)^(n-j) * (1/2)^j * binomial(n-j,j) = Sum_{j=0..n} (2*k)^j * (1/2)^(n-j) * binomial(j,n-j).
T(n,k) = (-sqrt(k)*i)^n * U(n, sqrt(k)*i) where U(n, x) is a Chebyshev polynomial of the second kind.

A015541 Expansion of x/(1 - 5x - 7x^2).

Original entry on oeis.org

0, 1, 5, 32, 195, 1199, 7360, 45193, 277485, 1703776, 10461275, 64232807, 394392960, 2421594449, 14868722965, 91294775968, 560554940595, 3441838134751, 21133075257920, 129758243232857, 796722742969725, 4891921417478624, 30036666288181195

Offset: 0

Olivier Gérard

Pisano period lengths: 1, 3, 8, 6, 8, 24, 6, 6, 24, 24, 5, 24, 12, 6, 8, 12, 16, 24, 120, 24, ... - R. J. Mathar, Aug 10 2012

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (5,7).

Cf. A001076, A006190, A007482, A015520, A015521, A015523, A015524, A015525, A015528, A015529, A015530, A015531, A015532, A015533, A015534, A015535, A015536, A015537, A015443, A015447, A030195, A053404, A057087, A057088, A083858, A085939, A090017, A091914, A099012, A180222, A180226.

[n le 2 select n-1 else 5*Self(n-1) + 7*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Nov 13 2012

Join[{a=0,b=1},Table[c=5*b+7*a;a=b;b=c,{n,100}]] (* Vladimir Joseph Stephan Orlovsky, Jan 16 2011 *)
LinearRecurrence[{5, 7}, {0, 1}, 30] (* Vincenzo Librandi, Nov 13 2012 *)

x='x+O('x^30); concat([0], Vec(x/(1-5*x-7*x^2))) \\ G. C. Greubel, Jan 24 2018

[lucas_number1(n,5,-7) for n in range(0, 21)] # Zerinvary Lajos, Apr 24 2009

a(n) = 5*a(n-1) + 7*a(n-2).

cp's OEIS Frontend

A135030 Generalized Fibonacci numbers: a(n) = 6*a(n-1) + 2*a(n-2).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

Extensions

A084059 a(n) = 4*a(n-1) + 2*a(n-2) for n>1, a(0)=1, a(1)=2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

PARI

Sage

Formula

A164549 a(n) = 4*a(n-1) + 2*a(n-2) for n > 1; a(0) = 1, a(1) = 6.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Formula

A180250 a(n) = 5*a(n-1) + 10*a(n-2), with a(1)=0 and a(2)=1.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

PARI

SageMath

Formula

A015551 Expansion of x/(1 - 6*x - 5*x^2).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Formula

A368152 Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 3*x, p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 3 - x^2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

A135030 Generalized Fibonacci numbers: a(n) = 6a(n-1) + 2a(n-2).

A084059 a(n) = 4a(n-1) + 2a(n-2) for n>1, a(0)=1, a(1)=2.

A164549 a(n) = 4a(n-1) + 2a(n-2) for n > 1; a(0) = 1, a(1) = 6.

A180250 a(n) = 5a(n-1) + 10a(n-2), with a(1)=0 and a(2)=1.

A015551 Expansion of x/(1 - 6x - 5x^2).

A368152 Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 3x, p(n,x) = up(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 3 - x^2.

A107979 a(n) = 4a(n-1) + 2a(n-2) for n>1, with a(0)=2, a(1)=9.

A189800 a(n) = 6a(n-1) + 8a(n-2), with a(0)=0, a(1)=1.

A342134 Square array T(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of g.f. 1/(1 - 2kx - k*x^2).

A015541 Expansion of x/(1 - 5x - 7x^2).