A030195 -id:A030195 - cp's OEIS frontend

A123585 Triangle T(n,k), 0<=k<=n, given by [1, -1, 1, 0, 0, 0, 0, 0, ...] DELTA [1, 1, -1, 0, 0, 0, 0, 0, ...] where DELTA is the operator defined in A084938.

1, 1, 1, 0, 2, 2, -1, 1, 5, 3, -1, -2, 4, 10, 5, 0, -4, -4, 12, 20, 8, 1, -2, -13, -4, 31, 38, 13, 1, 3, -11, -33, 3, 73, 71, 21, 0, 6, 6, -42, -74, 34, 162, 130, 34, -1, 3, 24, 0, -130, -146, 128, 344, 235, 55, -1, -4, 21, 72, -50, -352

Offset: 0

Philippe Deléham, Nov 13 2006

			Triangle begins:
1;
1, 1;
0, 2, 2;
-1, 1, 5, 3;
-1, -2, 4, 10, 5;
0, -4, -4, 12, 20, 8;
1, -2, -13, -4, 31, 38, 13;
1, 3, -11, -33, 3, 73, 71, 21;
0, 6, 6, -42, -74, 34, 162, 130, 34;

G. C. Greubel, Table of n, a(n) for the first 50 rows, flattened

Cf. A010892, A099254, A000045, A000079 (row sums), A001629, A129707.

CoefficientList[CoefficientList[Series[1/(1 - (1 + y)*x + (1 - y^2)*x^2), {x, 0, 10}, {y, 0, 10}], x], y] // Flatten (* G. C. Greubel, Oct 16 2017 *)

Sum_{k,0<=k<=n} T(n,k) = 2^n = A000079(n).
T(n,0) = A010892(n).
T(n,n) = Fibonacci(n+1) = A000045(n+1).
T(n+1,1) = A099254(n).
T(n+1,n) = A001629(n+2).
Sum_{k, 0<=k<=[n/2]} T(n-k,k) = A003269(n).
T(n,k) = T(n-1,k-1) + T(n-1,k) + T(n-2,k-2) - T(n-2,k), n>0.
Sum_{k, 0<=k<=n} x^k*T(n,k) = (-1)^n*A003683(n+1), (-1)^n*A006130(n), A000007(n), A010892(n), A000079(n), A030195(n+1) for x=-3, -2, -1, 0, 1, 2 respectively . - Philippe Deléham, Dec 01 2006
T(n+2,n) = A129707(n+1).- Philippe Deléham, Dec 18 2011
G.f.: 1/(1-(1+y)*x+(1-y^2)*x^2). - Philippe Deléham, Dec 18 2011

A083857 Square array T(n,k) of binomial transforms of generalized Fibonacci numbers, read by ascending antidiagonals, with n, k >= 0.

Original entry on oeis.org

0, 0, 1, 0, 1, 3, 0, 1, 3, 7, 0, 1, 3, 8, 15, 0, 1, 3, 9, 21, 31, 0, 1, 3, 10, 27, 55, 63, 0, 1, 3, 11, 33, 81, 144, 127, 0, 1, 3, 12, 39, 109, 243, 377, 255, 0, 1, 3, 13, 45, 139, 360, 729, 987, 511, 0, 1, 3, 14, 51, 171, 495, 1189, 2187, 2584, 1023, 0, 1, 3, 15, 57, 205, 648

Offset: 0

Paul Barry, May 06 2003

Row n >= 0 of the array gives the solution to the recurrence b(k) = 3*b(k-1) + (n-2) * a(k-2) for k >= 2 with a(0) = 0 and a(1) = 1. These are the binomial transforms of the rows of the generalized Fibonacci numbers A083856.

			Array T(n,k) (with rows n >= 0 and columns k >= 0) begins as follows:
  0, 1, 3,  7, 15,  31,  63,  127,  255, ...
  0, 1, 3,  8, 21,  55, 144,  377,  987, ...
  0, 1, 3,  9, 27,  81, 243,  729, 2187, ...
  0, 1, 3, 10, 33, 109, 360, 1189, 3927, ...
  0, 1, 3, 11, 39, 139, 495, 1763, 6279, ...
  0, 1, 3, 12, 45, 171, 648, 2457, 9315, ...
  ...

OEIS, Transformations of integer sequences.

Rows include A000225 (n=0), A001906 (n=1), A000244 (n=2), A006190 (n=3), A007482 (n=4), A030195 (n=5), A015521 (n=6).

Cf. A083856, A083861 (binomial transform), A083862 (main diagonal).

T(n, k) = ((3 + sqrt(4*n + 1))/2)^k / sqrt(4*n + 1) - ((3 - sqrt(4*n + 1))/2)^k / sqrt(4*n + 1) for n, k >= 0.
O.g.f. of row n >= 0: -x/(-1 + 3*x + (n-2)*x^2) . - R. J. Mathar, Nov 23 2007
T(n,k) = Sum_{i = 0..k} binomial(k,i)*A083856(n,i). - Petros Hadjicostas, Dec 24 2019

Various sections edited by Petros Hadjicostas, Dec 24 2019

A085480 Expansion of 3x(1+2x)/(1-3x-3*x^2).

Original entry on oeis.org

0, 3, 15, 54, 207, 783, 2970, 11259, 42687, 161838, 613575, 2326239, 8819442, 33437043, 126769455, 480619494, 1822166847, 6908359023, 26191577610, 99299809899, 376474162527, 1427321917278, 5411388239415, 20516130470079

Offset: 1

Gary W. Adamson, Jul 02 2003

A Jacobsthal variation.

p - q = sqrt(21); p*q = -3; p + q = 3.

			a(4) = q^4 + q^4 = 207; p^5 + q^5 = 783, where p = (3 + sqrt(21))/2, q = (3 - sqrt(21))/2.

Thomas Koshy, "Fibonacci and Lucas Numbers with Applications", Wiley, 2001, p. 471.

Harvey P. Dale, Table of n, a(n) for n = 1..1000
Tanya Khovanova, Recursive Sequences
Index entries for linear recurrences with constant coefficients, signature (3,3).

Cf. A030195.

CoefficientList[Series[3x (1+2x)/(1-3x-3x^2),{x,0,30}],x] (* or *) LinearRecurrence[{3,3},{0,3,15},30] (* Harvey P. Dale, Jan 10 2021 *)

a(n) = p^n + q^n, where p = (3 + sqrt(21))/2, q = (3 - sqrt 21)/2.
a(n) = 3*a(n-1) + 3*a(n-2), a(1)=3, a(2)=15. - Philippe Deléham, Nov 19 2008
G.f.: G(0)/x - 2/x, where G(k) = 1 + 1/(1 - x*(7*k-3)/(x*(7*k+4) - 2/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, Jun 03 2013

Zero prepended by Harvey P. Dale, Jan 10 2021

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

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

Original entry on oeis.org

1, 1, 0, 1, 1, 0, 1, 2, 2, 0, 1, 3, 6, 3, 0, 1, 4, 12, 16, 5, 0, 1, 5, 20, 45, 44, 8, 0, 1, 6, 30, 96, 171, 120, 13, 0, 1, 7, 42, 175, 464, 648, 328, 21, 0, 1, 8, 56, 288, 1025, 2240, 2457, 896, 34, 0, 1, 9, 72, 441, 1980, 6000, 10816, 9315, 2448, 55, 0

Offset: 0

Seiichi Manyama, Feb 28 2021

			Square array begins:
  1, 1,   1,   1,    1,    1, ...
  0, 1,   2,   3,    4,    5, ...
  0, 2,   6,  12,   20,   30, ...
  0, 3,  16,  45,   96,  175, ...
  0, 5,  44, 171,  464, 1025, ...
  0, 8, 120, 648, 2240, 6000, ...

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

Columns 0..10 give A000007, A000045(n+1), A002605(n+1), A030195(n+1), A057087, A057088, A057089, A057090, A057091, A057092, A057093.
Rows 0..2 give A000012, A001477, A002378.
Main diagonal gives A109516(n+1).
Cf. A342129, A342133, A342134.

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, k^j] * Binomial[j, n - j], {j, 0, n}]; Table[T[k, n - k], {n, 0, 10}, {k, 0, n}] // Flatten (* Amiram Eldar, Apr 28 2021 *)

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

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

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

T(0,k) = 1, T(1,k) = k and T(n,k) = k*(T(n-1,k) + T(n-2,k)) for n > 1.
T(n,k) = Sum_{j=0..floor(n/2)} k^(n-j) * binomial(n-j,j) = Sum_{j=0..n} k^j * binomial(j,n-j).
T(n,k) = (-sqrt(k)*i)^n * S(n, sqrt(k)*i) with S(n, x) := U(n, x/2), Chebyshev's polynomials of the 2nd kind.

A368153 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) + vp(n-2,x) for n >= 3, where u = p(2,x), v = 1 - 3x - x^2.

Original entry on oeis.org

1, 1, 2, 2, 1, 3, 3, 4, -2, 4, 5, 5, 4, -10, 5, 8, 10, -3, 4, -25, 6, 13, 16, 1, -29, 14, -49, 7, 21, 28, -8, -24, -78, 56, -84, 8, 34, 47, -12, -88, -26, -162, 168, -132, 9, 55, 80, -31, -140, -200, 100, -330, 408, -195, 10, 89, 135, -58, -301, -230, -296

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   2
   2   1   3
   3   4  -2    4
   5   5   4  -10    5
   8  10  -3    4  -25    6
  13  16   1  -29   14  -49    7
  21  28  -8  -24  -78   56  -84   8
Row 4 represents the polynomial p(4,x) = 3 + 4*x - 2*x^2 + 4*x^3, so (T(4,k)) = (3,4,-2,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), 1-28, Paper No. A14.

Cf. A000045 (column 1); A000027 (p(n,n-1)); A057083 (row sums), (p(n,1)); A182228 (alternating row sums), (p(n,-1)); A190970, (p(n,2)); A030195, (p(n,-2)); A052918, (p(n,-3)); A190972, (p(n,-4)); A057085, (p(n,-5)); A094440, A367208, A367209, A367210, A367211, A367297, A367298, A367299, A367300, A367301, A368150, A368151, A368152.

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

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

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).

A015544 Lucas sequence U(5,-8): a(n+1) = 5a(n) + 8a(n-1), a(0)=0, a(1)=1.

Original entry on oeis.org

0, 1, 5, 33, 205, 1289, 8085, 50737, 318365, 1997721, 12535525, 78659393, 493581165, 3097180969, 19434554165, 121950218577, 765227526205, 4801739379641, 30130517107845, 189066500576353, 1186376639744525, 7444415203333449, 46713089134623445

Offset: 0

Olivier Gérard

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

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

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

a[n_]:=(MatrixPower[{{1,2},{1,-6}},n].{{1},{1}})[[2,1]]; Table[Abs[a[n]],{n,-1,40}] (* Vladimir Joseph Stephan Orlovsky, Feb 19 2010 *)
LinearRecurrence[{5, 8}, {0, 1}, 30] (* Vincenzo Librandi, Nov 13 2012 *)

A015544(n)=imag((2+quadgen(57))^n) \\ M. F. Hasler, Mar 06 2009

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

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

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

G.f.: x/(1 - 5*x - 8*x^2). - M. F. Hasler, Mar 06 2009

More precise definition by M. F. Hasler, Mar 06 2009

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

Original entry on oeis.org

1, 2, 7, 17, 52, 137, 397, 1082, 3067, 8477, 23812, 66197, 185257, 516242, 1442527, 4023737, 11236372, 31355057, 87536917, 244312202, 681996787, 1903557797, 5313541732, 14831330717, 41399039377, 115555692962, 322550889847, 900329354657, 2513083803892

Offset: 0

Philippe Deléham, Jan 03 2008

Alois P. Heinz, Table of n, a(n) for n = 0..1000 (first 100 terms from Matt C. Anderson)
Index entries for linear recurrences with constant coefficients, signature (1,5).

Cf. A030195 (shifted binomial transform).

a:= n-> (<<0|1>, <5|1>>^n. <<1, 2>>)[1,1]:
seq(a(n), n=0..30);  # Alois P. Heinz, Jan 20 2025

LinearRecurrence[{1,5},{1,2},30] (* Harvey P. Dale, Jul 23 2013 *)

x='x+O('x^99); Vec((1+x)/(1-x-5*x^2)) \\ Altug Alkan, Aug 28 2017

G.f.: (1+x)/(1-x-5*x^2).
a(n) = Sum_{k=0..n+1} A122950(n+1,k)*4^(n+1-k). - Philippe Deléham, Jan 08 2008
a(n) = ((21 - 3*sqrt(21))/42)*(1/2 - (1/2)*sqrt(21))^n + ((21 + 3*sqrt(21))/42)*(1/2 + (1/2)*sqrt(21))^n. - Richard Choulet, Nov 20 2008

A199324 Triangle T(n,k), read by rows, given by (-1,1,-1,0,0,0,0,0,0,0,...) DELTA (1,0,0,0,0,0,0,0,0,0,...) where DELTA is the operator defined in A084938.

Original entry on oeis.org

1, -1, 1, 0, -1, 1, 1, -1, -1, 1, -1, 3, -2, -1, 1, 0, -2, 5, -3, -1, 1, 1, -2, -2, 7, -4, -1, 1, -1, 5, -7, -1, 9, -5, -1, 1, 0, -3, 12, -15, 1, 11, -6, -1, 1, 1, -3, -3, 21, -26, 4, 13, -7, -1, 1, -1, 7, -15, 3, 31, -40, 8, 15, -8, -1, 1, 0, -4, 22, -42

Offset: 0

Philippe Deléham, Nov 12 2011

			Triangle begins :
1
-1, 1
0, -1, 1
1, -1, -1, 1
-1, 3, -2, -1, 1
0, -2, 5, -3, -1, 1
1, -2, -2, 7, -4, -1, 1
-1, 5, -7, -1, 9, -5, -1, 1

Cf. A026729, A063967, A129267, A176971 (diagonals sums).

T(n,k)=T(n-1,k-1)+T(n-2,k-1)-T(n-1,k)-T(n-2,k), T(0,0)=1.
G.f.: 1/(1-(y-1)*x-(y-1)*x^2).
Sum_{k, 0<=k<=n}T(n,k)*x^k = A000748(n), A108520(n), A049347(n), A000007(n), A000045(n+1), A002605(n+1), A030195(n+1), A057087(n), A057088(n), A057089(n), A057090(n), A057091(n), A057092(n), A057093(n) for x = -2,-1,0,1,2,3,4,5,6,7,8,9,10,11 respectively.

cp's OEIS Frontend

A123585 Triangle T(n,k), 0<=k<=n, given by [1, -1, 1, 0, 0, 0, 0, 0, ...] DELTA [1, 1, -1, 0, 0, 0, 0, 0, ...] where DELTA is the operator defined in A084938.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A083857 Square array T(n,k) of binomial transforms of generalized Fibonacci numbers, read by ascending antidiagonals, with n, k >= 0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

Extensions

A085480 Expansion of 3*x*(1+2*x)/(1-3*x-3*x^2).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

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

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

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

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

PARI

Formula

A368153 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 - 3*x - x^2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

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

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

A085480 Expansion of 3x(1+2x)/(1-3x-3*x^2).

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

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

A368153 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) + vp(n-2,x) for n >= 3, where u = p(2,x), v = 1 - 3x - x^2.

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

A015544 Lucas sequence U(5,-8): a(n+1) = 5a(n) + 8a(n-1), a(0)=0, a(1)=1.