A152268 -id:A152268 - cp's OEIS frontend

A190958 a(n) = 2a(n-1) - 10a(n-2), with a(0) = 0, a(1) = 1.

0, 1, 2, -6, -32, -4, 312, 664, -1792, -10224, -2528, 97184, 219648, -532544, -3261568, -1197696, 30220288, 72417536, -157367808, -1038910976, -504143872, 9380822016, 23803082752, -46202054656, -330434936832, -198849327104, 2906650714112, 7801794699264

Offset: 0

Vladimir Joseph Stephan Orlovsky, May 24 2011

For the difference equation a(n) = c*a(n-1) - d*a(n-2), with a(0) = 0, a(1) = 1, the solution is a(n) = d^((n-1)/2) * ChebyshevU(n-1, c/(2*sqrt(d))) and has the alternate form a(n) = ( ((c + sqrt(c^2 - 4*d))/2)^n - ((c - sqrt(c^2 - 4*d))/2)^n )/sqrt(c^2 - 4*d). In the case c^2 = 4*d then the solution is a(n) = n*d^((n-1)/2). The generating function is x/(1 - c*x + d^2) and the exponential generating function takes the form (2/sqrt(c^2 - 4*d))*exp(c*x/2)*sinh(sqrt(c^2 - 4*d)*x/2) for c^2 > 4*d, (2/sqrt(4*d - c^2))*exp(c*x/2)*sin(sqrt(4*d - c^2)*x/2) for 4*d > c^2, and x*exp(sqrt(d)*x) if c^2 = 4*d. - G. C. Greubel, Jun 10 2022

Vincenzo Librandi, Table of n, a(n) for n = 0..190
Index entries for linear recurrences with constant coefficients, signature (2,-10).

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
.A128834,A107920,A106852,A106853,A106854,A145934,A145976,A145978,A146078,A146080
.A000027,A009545,A088137,A088138,A045873,A088139,A089181,A090591,A127357,A190958
.A001906,A000225,A057083,A049072,A190959,A190960,A190961,A190962,A190963,A190964
.A001353,A007070,A003462,A001787,A099456,A190965,A168175,A190966,A190967,A190968
.A004254,A107839,A116415,A002450,A030191,A001047,A099450,A190969,A190970,A190971
.A001109,A154244,A138395,A084326,A003463,A030192,A081179,A006516,A027471,A106392
.A004187,A186446,A190972,A190973,A190974,A003464,A030240,A152268,A099459,A016127
.A001090,A190975,A190976,A099156,A190977,A190978,A023000,A057084,A154245,A154235
.A018913,A190979,A190980,A190981,A190982,A190983,A190984,A023001,A057085,A178869
A004189,A190869,A190985,A190986,A190987,A190988,A190989,A190990,A002452,A057086

I:=[0,1]; [n le 2 select I[n] else 2*Self(n-1)-10*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Sep 17 2011

Mathematica
```
LinearRecurrence[{2,-10}, {0,1}, 50]
```

a(n)=([0,1; -10,2]^n*[0;1])[1,1] \\ Charles R Greathouse IV, Apr 08 2016

[lucas_number1(n,2,10) for n in (0..50)] # G. C. Greubel, Jun 10 2022

G.f.: x / ( 1 - 2*x + 10*x^2 ). - R. J. Mathar, Jun 01 2011
E.g.f.: (1/3)*exp(x)*sin(3*x). - Franck Maminirina Ramaharo, Nov 13 2018
a(n) = 10^((n-1)/2) * ChebyshevU(n-1, 1/sqrt(10)). - G. C. Greubel, Jun 10 2022
a(n) = (1/3)*10^(n/2)*sin(n*arctan(3)) = Sum_{k=0..floor(n/2)} (-1)^k*3^(2*k)*binomial(n,2*k+1). - Gerry Martens, Oct 15 2022

A103280 Array read by antidiagonals, generated by the matrix M = [1,1,1;1,N,1;1,1,1].

Original entry on oeis.org

1, 1, 2, 1, 3, 6, 1, 4, 9, 16, 1, 5, 14, 27, 44, 1, 6, 21, 48, 81, 120, 1, 7, 30, 85, 164, 243, 328, 1, 8, 41, 144, 341, 560, 729, 896, 1, 9, 54, 231, 684, 1365, 1912, 2187, 2448, 1, 10, 69, 352, 1289, 3240, 5461, 6528, 6561, 6688, 1, 11, 86, 513, 2276, 7175, 15336, 21845

Offset: 0

Lambert Klasen (lambert.klasen(AT)gmx.net), Jan 27 2005

Consider the matrix M = [1,1,1;1,N,1;1,1,1];
Characteristic polynomial of M is x^3 + (-N - 2)*x^2 + (2*N - 2)*x.
Now (M^n)[1,2] is equivalent to the recursion a(1) = 1, a(2) = N+2, a(n) = (N+2)a(n-1)+(2N-2)a(n-2). (This also holds for negative N and fractional N.)
a(n+1)/a(n) converges to the upper root of the characteristic polynomial ((N + 2) + sqrt((N - 2)^2 + 8))/2 for n to infinity.
Columns of array follow the polynomials:
0
1
N + 2
N^2 + 2*N + 6
N^3 + 2*N^2 + 8*N + 16
N^4 + 2*N^3 + 10*N^2 + 24*N + 44
N^5 + 2*N^4 + 12*N^3 + 32*N^2 + 76*N + 120
N^6 + 2*N^5 + 14*N^4 + 40*N^3 + 112*N^2 + 232*N + 328
N^7 + 2*N^6 + 16*N^5 + 48*N^4 + 152*N^3 + 368*N^2 + 704*N + 896
N^8 + 2*N^7 + 18*N^6 + 56*N^5 + 196*N^4 + 528*N^3 + 1200*N^2 + 2112*N + 2448
etc.

			Array begins:
1,2,6,16,44,120,328,896,2448,6688,...
1,3,9,27,81,243,729,2187,6561,19683, ...
1,4,14,48,164,560,1912,6528,22288,76096,...
1,5,21,85,341,1365,5461,21845,87381,349525,...
1,6,30,144,684,3240,15336,72576,343440,1625184,...
1,7,41,231,1289,7175,39913,221991,1234633,6866503,...
...

Cf. A103279 (for (M^n)[1, 1]), A002605 (for N=0), A000244 (for N=1), A007070 (for N=2), A002450 (for N=3), A030192 (for N=4), A152268 (for N=5), A006131 (for N=-1), A000400 (bisection for N=-2), A015443 (for N=-3), A083102 (for N=-4).

T12(N, n) = if(n==1,1,if(n==2,N+2,(N+2)*T12(N,n-1)-(2*N-2)*T12(N,n-2)))
for(k=0,10,print1(k,": ");for(i=1,10,print1(T12(k,i),","));print())

T(N, 1)=1, T(N, 2)=N+2, T(N, n)=(N+2)*T(N, n-1)-(2*N-2)*T(N, n-2).

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

Original entry on oeis.org

1, 1, 2, 2, 4, 3, 3, 10, 10, 4, 5, 20, 31, 20, 5, 8, 40, 78, 76, 35, 6, 13, 76, 184, 232, 161, 56, 7, 21, 142, 406, 636, 582, 308, 84, 8, 34, 260, 861, 1604, 1831, 1296, 546, 120, 9, 55, 470, 1766, 3820, 5215, 4630, 2640, 912, 165, 10, 89, 840, 3533, 8696

Offset: 1

Clark Kimberling, Dec 25 2023

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    2
   2    4    3
   3   10   10    4
   5   20   31   20    5
   8   40   78   76   35    6
  13   76  184  232  161   56   7
  21  142  406  636  582  308  84  8
Row 4 represents the polynomial p(4,x) = 3 + 10*x + 10*x^2 + 4*x^3, so (T(4,k)) = (3,10,10,4), k=0..3.

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

Cf. A000045 (column 1); A000027 (p(n,n-1)); A000244 (row sums), (p(n,1)); A033999 (alternating row sums), (p(n,-1)); A116415 (p(n,2)), A000748, (p(n,-2)); A152268, (p(n,3)); A190969, (p(n,-3)); A094440, A367208, A367209, A367210, A367211, A367297, A367298, A367299, A367300, A367301, A368150.

p[1, x_] := 1; p[2, x_] := 1 + 2 x; u[x_] := p[2, x]; v[x_] := 1 - 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 + 2*x, u = p(2,x), and v = 1 - x^2.

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

cp's OEIS Frontend

A190958 a(n) = 2a(n-1) - 10a(n-2), with a(0) = 0, a(1) = 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

SageMath

Formula

A103280 Array read by antidiagonals, generated by the matrix M = [1,1,1;1,N,1;1,1,1].

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI

Formula

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

cp's OEIS Frontend

A190958 a(n) = 2*a(n-1) - 10*a(n-2), with a(0) = 0, a(1) = 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

SageMath

Formula

A103280 Array read by antidiagonals, generated by the matrix M = [1,1,1;1,N,1;1,1,1].

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI

Formula

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A190958 a(n) = 2a(n-1) - 10a(n-2), with a(0) = 0, a(1) = 1.

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