A083856 -id:A083856 - cp's OEIS frontend

A083859 Main diagonal of generalized Fibonacci array A083856.

0, 1, 1, 4, 9, 41, 133, 673, 2737, 15130, 72181, 430739, 2320825, 14815529, 88005541, 596681296, 3843559137, 27515587661, 189933449365, 1428716457761, 10474213334761, 82448447397646, 637534807917701, 5233087759204967, 42445677865505425, 362213650380301201

Offset: 0

Paul Barry, May 06 2003

If a sequence (s(n): n >= 0) is of the form s(0) = 0, s(1) = x, and s(n) = s(n-1) + k*s(n-2) for n >= 2 (for some integer k >= 0 and some number x), then s(k) = a(k)*x. For example if k = 7 and x = 5, then (s(n): n = 0..7) = (0, 5, 5, 40, 75, 355, 880, 3365) and s(7) = 3365 = 673*5 = a(7)*x. - Gary Detlefs, Dec 04 2009 [Edited by Petros Hadjicostas, Dec 24 2019]

G. C. Greubel, Table of n, a(n) for n = 0..690

Cf. A083856, A083860, A193376.

Concatenation([0], List([1..30], n-> Sum([0..Int((n-1)/2)], j-> Binomial(n-j-1, j)*n^j) )); # G. C. Greubel, Dec 27 2019

[0] cat [ &+[Binomial(n-j-1, j)*n^j: j in [0..Floor((n-1)/2)]] : n in [1..30]]; // G. C. Greubel, Dec 27 2019

seq( `if`(n=0, 0, simplify( (-sqrt(n)*I)^(n-1)*ChebyshevU(n-1, I/(2*sqrt(n)))) ), n=0..30); # G. C. Greubel, Dec 27 2019
# second Maple program:
a:= n-> (<<0|1>, >^n)[1, 2]:
seq(a(n), n=0..25);  # Alois P. Heinz, Oct 19 2021

Table[DifferenceRoot[Function[{y, m}, {y[2 + m] == y[1 + m] + n*y[m], y[0] == 0, y[1] == 1}]][n], {n, 0, 20}] (* Benedict W. J. Irwin, Nov 03 2016 *)
Table[If[n==0, 0, Round[(Sqrt[n])^(n-1)*Fibonacci[n, 1/Sqrt[n]] ]], {n,0,30}] (* G. C. Greubel, Dec 27 2019 *)

vector(31, n, if(n==1, 0, round((-sqrt(n-1)*I)^(n-2)*polchebyshev(n-2, 2, I/(2*sqrt(n-1)))) ) ) \\ G. C. Greubel, Dec 27 2019

[0]+[(-sqrt(n)*I)^(n-1)*chebyshev_U(n-1, I/(2*sqrt(n))) for n in (1..30)] # G. C. Greubel, Dec 27 2019

a(n) = (((1 + sqrt(4*n + 1))/2)^n - ((1 - sqrt(4*n + 1))/2)^n)/sqrt(4*n + 1).
a(n) = A193376(n-1,n) for n >= 2. - R. J. Mathar, Aug 23 2011
a(n) = y(n,n), where y(m+2,n) = y(m+1,n) + n*y(m,n) with y(0,n) = 0 and y(1,n) = 1 for all n. - Benedict W. J. Irwin, Nov 03 2016
a(n) = [x^n] x/(1 - x - n*x^2). - Ilya Gutkovskiy, Oct 10 2017
a(n) = Sum_{s = 0..floor((n-1)/2)} binomial(n-1-s, s) * n^s. - Petros Hadjicostas, Dec 24 2019
From G. C. Greubel, Dec 27 2019: (Start)
a(n) = (sqrt(n))^n * Fibonacci(n, 1/sqrt(n)), with a(0)=0.
a(n) = (-sqrt(n)*i)^(n-1)*ChebyshevU(n-1, i/(2*sqrt(n))), with a(0)=0. (End)

A083860 First subdiagonal of generalized Fibonacci array A083856.

Original entry on oeis.org

0, 1, 1, 5, 11, 55, 176, 937, 3781, 21571, 102455, 624493, 3356640, 21752431, 129055681, 884773585, 5696734715, 41129090011, 283908657880, 2149818248341, 15765656131765, 124759995175751, 965186517474191, 7956847444317049, 64577172850366176, 553048437381116275

Offset: 0

Paul Barry, May 06 2003

Cf. A083856, A083859.

T := proc(n, k) local v; option remember; if 0 <= n and k = 0 then v := 0; end if; if 0 <= n and k = 1 then v := 1; end if; if 0 <= n and 2 <= k then v := T(n, k - 1) + n*T(n, k - 2); end if; v; end proc;
seq(T(n + 1, n), n = 0 .. 40); # Petros Hadjicostas, Dec 25 2019

T[, 0] = 0; T[, 1|2] = 1;
T[n_, k_] := T[n, k] = T[n, k-1] + n T[n, k-2];
a[n_] := T[n+1, n];
Table[a[n], {n, 0, 23}] (* Jean-François Alcover, Sep 26 2022 *)

a(n) = (((1 + sqrt(4*n + 5))/2)^n - ((1 - sqrt(4*n + 5))/2)^n)/sqrt(4*n + 5).
a(n) = A193376(n-1, n+1) for n >= 2. - R. J. Mathar, Aug 23 2011
a(n) = Sum_{s = 0..floor((n-1)/2)} binomial(n-1-s, s) * (n+1)^s. - Petros Hadjicostas, Dec 25 2019

A110113 Diagonal sums of A083856.

Original entry on oeis.org

0, 1, 2, 3, 5, 9, 17, 34, 71, 154, 346, 802, 1914, 4693, 11800, 30379, 79963, 214925, 589223, 1645994, 4681037, 13541446, 39817560, 118925810, 360577616, 1109158545, 3459636358, 10936941299, 35026082521, 113588037953

Offset: 0

Paul Barry, Jul 12 2005

Sums of antidiagonals of A083856.

A. G. Shannon and J. V. Leyendekkers, The Golden Ratio family and the Binet equation, Notes on Number Theory and Discrete Mathematics, 21(2) (2015), 35-42.

T := proc(n, k) local v; option remember; if 0 <= n and k = 0 then v := 0; end if; if 0 <= n and k = 1 then v := 1; end if; if 0 <= n and 2 <= k then v := T(n, k - 1) + n*T(n, k - 2); end if; v; end proc;
a := proc(n) local k; add(T(n - k, k), k = 0 .. n); end proc;
seq(a(n), n = 0..40); # Petros Hadjicostas, Dec 26 2019

a(n) = Sum_{k = 0..n} ((1 + sqrt(4*(n - k) + 1))/2)^k / sqrt(4*(n - k) + 1) - ((1 -sqrt(4*(n - k) + 1))/2)^k / sqrt(4*(n - k) + 1). [Corrected by Petros Hadjicostas, Dec 26 2019]

A193376 T(n,k) = number of ways to place any number of 2 X 1 tiles of k distinguishable colors into an n X 1 grid; array read by descending antidiagonals, with n, k >= 1.

Original entry on oeis.org

1, 1, 2, 1, 3, 3, 1, 4, 5, 5, 1, 5, 7, 11, 8, 1, 6, 9, 19, 21, 13, 1, 7, 11, 29, 40, 43, 21, 1, 8, 13, 41, 65, 97, 85, 34, 1, 9, 15, 55, 96, 181, 217, 171, 55, 1, 10, 17, 71, 133, 301, 441, 508, 341, 89, 1, 11, 19, 89, 176, 463, 781, 1165, 1159, 683, 144, 1, 12, 21, 109, 225, 673

Offset: 1

R. H. Hardin, Jul 24 2011

Transposed variant of A083856. - R. J. Mathar, Aug 23 2011

As to the sequences by columns beginning (1, N, ...), let m = (N-1). The g.f. for the sequence (1, N, ...) is 1/(1 - x - m*x^2). Alternatively, the corresponding matrix generator is [[1,1], [m,0]]. Another equivalency is simply: The sequence beginning (1, N, ...) is the INVERT transform of (1, m, 0, 0, 0, ...). Convergents to the sequences a(n)/a(n-1) are (1 + sqrt(4*m+1))/2. - Gary W. Adamson, Feb 25 2014

			Array T(n,k) (with rows n >= 1 and column k >= 1) begins as follows:
  ..1...1....1....1.....1.....1.....1......1......1......1......1......1...
  ..2...3....4....5.....6.....7.....8......9.....10.....11.....12.....13...
  ..3...5....7....9....11....13....15.....17.....19.....21.....23.....25...
  ..5..11...19...29....41....55....71.....89....109....131....155....181...
  ..8..21...40...65....96...133...176....225....280....341....408....481...
  .13..43...97..181...301...463...673....937...1261...1651...2113...2653...
  .21..85..217..441...781..1261..1905...2737...3781...5061...6601...8425...
  .34.171..508.1165..2286..4039..6616..10233..15130..21571..29844..40261...
  .55.341.1159.2929..6191.11605.19951..32129..49159..72181.102455.141361...
  .89.683.2683.7589.17621.35839.66263.113993.185329.287891.430739.624493...
  ...
Some solutions for n = 5 and k = 3 with colors = 1, 2, 3 and empty = 0:
..0....2....3....2....0....1....0....0....2....0....0....2....3....0....0....0
..0....2....3....2....2....1....2....3....2....1....0....2....3....1....1....1
..1....0....0....0....2....0....2....3....2....1....0....1....0....1....1....1
..1....2....2....0....3....2....2....3....2....0....3....1....3....3....2....1
..0....2....2....0....3....2....2....3....0....0....3....0....3....3....2....1

R. H. Hardin, Table of n, a(n) for n = 1..9999
Ron H. Hardin, Re: A193376 Tabl = 20 existing sequences, Sequence Fans mailing list, 2011.
Robert Israel, Re: A193376 Tabl = 20 existing sequences, Sequence Fans mailing list, 2011.

Column 1 is A000045(n+1), column 2 is A001045(n+1), column 3 is A006130, column 4 is A006131, column 5 is A015440, column 6 is A015441(n+1), column 7 is A015442(n+1), column 8 is A015443, column 9 is A015445, column 10 is A015446, column 11 is A015447, and column 12 is A053404,
Row 2 is A000027(n+1), row 3 is A004273(n+1), row 4 is A028387, row 5 is A000567(n+1), and row 6 is A106734(n+2).
Diagonal is A171180, superdiagonal 1 is A083859(n+1), and superdiagonal 2 is A083860(n+1).

T:= proc(n,k) option remember; `if`(n<0, 0,
      `if`(n<2 or k=0, 1, k*T(n-2, k) +T(n-1, k)))
    end;
seq(seq(T(n, d+1-n), n=1..d), d=1..12); # Alois P. Heinz, Jul 29 2011

T[n_, k_] := T[n, k] = If[n < 0, 0, If[n < 2 || k == 0, 1, k*T[n-2, k]+T[n-1, k]]]; Table[Table[T[n, d+1-n], {n, 1, d}], {d, 1, 12}] // Flatten (* Jean-François Alcover, Mar 04 2014, after Alois P. Heinz *)

With z X 1 tiles of k colors on an n X 1 grid (with n >= z), either there is a tile (of any of the k colors) on the first spot, followed by any configuration on the remaining (n-z) X 1 grid, or the first spot is vacant, followed by any configuration on the remaining (n-1) X 1. Thus, T(n,k) = T(n-1,k) + k*T(n-z,k), with T(n,k) = 1 for n = 0, 1, ..., z-1.
The solution is T(n,k) = Sum_r r^(-n-1)/(1 + z*k*r^(z-1)), where the sum is over the roots r of the polynomial k*x^z + x - 1.
For z = 2, T(n,k) = ((2*k / (sqrt(1 + 4*k) - 1))^(n+1) - (-2*k/(sqrt(1 + 4*k) + 1))^(n+1)) / sqrt(1 + 4*k).
T(n,k) = Sum_{s=0..[n/2]} binomial(n-s,s) * k^s.
For z X 1 tiles, T(n,k,z) = Sum_{s = 0..[n/z]} binomial(n-(z-1)*s, s) * k^s. - R. H. Hardin, Jul 31 2011

Formula and proof from Robert Israel in the Sequence Fans mailing list.

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

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

Original entry on oeis.org

0, 0, 1, 0, 1, 5, 0, 1, 5, 19, 0, 1, 5, 20, 65, 0, 1, 5, 21, 75, 211, 0, 1, 5, 22, 85, 275, 665, 0, 1, 5, 23, 95, 341, 1000, 2059, 0, 1, 5, 24, 105, 409, 1365, 3625, 6305, 0, 1, 5, 25, 115, 479, 1760, 5461, 13125, 19171, 0, 1, 5, 26, 125, 551, 2185, 7573, 21845, 47500, 58025

Offset: 0

Paul Barry, May 06 2003

Row n >= 0 of the array gives the solution to the recurrence b(k) = 5*b(k-1) + (n - 6)*b(k-2) for k >= 2 with b(0) = 0 and b(1) = 1. The rows are the binomial transforms of the rows of array A083857. The rows are the second binomial transforms of the generalized Fibonacci numbers in array A083856.

			Array T(n,k) (with rows n >= 0 and columns k >= 0) begins as follows:
  0, 1, 5, 19,  65, 211,  665,  2059,  6305,  19171, ...
  0, 1, 5, 20,  75, 275, 1000,  3625, 13125,  47500, ...
  0, 1, 5, 21,  85, 341, 1365,  5461, 21845,  87381, ...
  0, 1, 5, 22,  95, 409, 1760,  7573, 32585, 140206, ...
  0, 1, 5, 23, 105, 479, 2185,  9967, 45465, 207391, ...
  0, 1, 5, 24, 115, 551, 2640, 12649, 60605, 290376, ...
  0, 1, 5, 25, 125, 625, 3125, 15625, 78125, 390625, ...
  ...

G. C. Greubel, Antidiagonals n = 0..100, flattened
OEIS, Transformations of integer sequences.

Rows include A001047 (n=0), A093131 (n=1), A002450 (n=2), A004254 (n=5), A000351 (n=6), A052918 (n=7), A015535 (n=8), A015536 (n=9), A015537 (n=10).

Cf. A083856 (second inverse binomial transform), A083856 (first inverse binomial transform), A082297 (main diagonal).

T:= func< n,k | Round( (((5+Sqrt(4*n+1))/2)^k - ((5-Sqrt(4*n+1))/2)^k)/Sqrt(4*n + 1) ) >;
[T(n-k,k): k in [0..n], n in [0..10]]; // G. C. Greubel, Dec 27 2019

seq(seq(round( (((5+sqrt(4*(n-k)+1))/2)^k - ((5-sqrt(4*(n-k)+1))/2)^k)/sqrt(4*(n-k)+1) ), k=0..n), n=0..10); # G. C. Greubel, Dec 27 2019

T[n_, k_]:= Round[(((5 +Sqrt[4*n+1])/2)^k - ((5 -Sqrt[4*n+1])/2)^k)/Sqrt[4*n+1]]; Table[T[n-k, k], {n, 0, 10}, {k, 0, n}]//Flatten (* G. C. Greubel, Dec 27 2019 *)

T(n, k) = round( (((5+sqrt(4*n+1))/2)^k - ((5-sqrt(4*n+1))/2)^k)/sqrt(4*n + 1) );
for(n=0,10, for(k=0,n, print1(T(n-k,k), ", "))) \\ G. C. Greubel, Dec 27 2019

[[round( (((5+sqrt(4*(n-k)+1))/2)^k - ((5-sqrt(4*(n-k)+1))/2)^k)/sqrt(4*(n-k)+1) ) for k in (0..n)] for n in (0..10)] # G. C. Greubel, Dec 27 2019

T(n, k) = (((5 + sqrt(4*n + 1))/2)^k - ((5 - sqrt(4*n + 1))/2)^k)/sqrt(4*n + 1).
O.g.f. for row n >= 0: -x/(-1 + 5*x + (n-6)*x^2) . - R. J. Mathar, Dec 02 2007
From Petros Hadjicostas, Dec 25 2019: (Start)
T(n,k) = 5*T(n,k-1) + (n - 6)*T(n,k-2) for k >= 2 with T(n,0) = 0 and T(n,1) = 1 for all n >= 0.
T(n,k) = Sum_{i = 0..k} binomial(k,i) * A083857(n,i).
T(n,k) = Sum_{i = 0..k} Sum_{j = 0..i} binomial(k,i) * binomial(i,j) * A083856(n,j). (End)

Name and various sections edited by Petros Hadjicostas, Dec 25 2019

A110112 Square array of numbers associated to the recurrences b(k) = b(k-1) + n*b(k-2); array T(n,k), read by descending antidiagonals, for n, k >= 0.

Original entry on oeis.org

1, 1, 1, 1, 3, 1, 1, 15, 5, 1, 1, 60, 55, 7, 1, 1, 260, 385, 133, 9, 1, 1, 1092, 3311, 1330, 261, 11, 1, 1, 4641, 25585, 18430, 3393, 451, 13, 1, 1, 19635, 208335, 210490, 68237, 7216, 715, 15, 1, 1, 83215, 1652145, 2673223, 1037673, 197456, 13585, 1065, 17, 1, 1

Offset: 0

Paul Barry, Jul 12 2005

Rows include A001655, (-1)^n*A015266(n+3), A110111.

			Array T(n,k) (with rows n >= 0 and columns k >= 0) begins as follows:
  1,  1,   1,    1,      1,       1,        1,          1, ...
  1,  3,  15,   60,    260,    1092,     4641,      19635, ...
  1,  5,  55,  385,   3311,   25585,   208335,    1652145, ...
  1,  7, 133, 1330,  18430,  210490,  2673223,   31940881, ...
  1,  9, 261, 3393,  68237, 1037673, 18598293,  300963537, ...
  1, 11, 451, 7216, 197456, 3761296, 89565861, 1842200151, ...
  ...

Cf. A083856.

a := proc(n, k) local v; option remember; if k = 0 and 0 <= n then v := 0; end if; if k = 1 and 0 <= n then v := 1; end if; if 2 <= k and 0 <= n then v := a(n, k - 1) + n*a(n, k - 2); end if; v; end proc;
T := proc(n, k) a(n, k + 1)*a(n, k + 2)*a(n, k + 3)/(n + 1); end proc;
seq(seq(T(k,n-k), k=0..n), n=0..10); # Petros Hadjicostas, Dec 26 2019

T(n, k) = a(n, k+1) * a(n, k+2) * a(n, k+3)/(n+1), where a(n, k) is the solution to a(n, k) = a(n, k-1) + n*a(n, k-2) for k >= 2 with a(n, 0) = 0 and a(n, 1) = 1 for all n >= 0.

Row n has g.f. 1/((1 + n*x - n^3*x^2) * (1 - (3*n + 1)*x - n^3*x^2)).

A172237 T(n,k) = T(n-1,k) + k*T(n-2,k) for k >= 1 and n >= 3 with T(0,k) = 0 and T(1,k) = T(2,k) = 1 for all k >= 1; array T(n,k), read by descending antidiagonals, with n >= 0 and k >= 1.

Original entry on oeis.org

0, 0, 1, 0, 1, 1, 0, 1, 1, 2, 0, 1, 1, 3, 3, 0, 1, 1, 4, 5, 5, 0, 1, 1, 5, 7, 11, 8, 0, 1, 1, 6, 9, 19, 21, 13, 0, 1, 1, 7, 11, 29, 40, 43, 21, 0, 1, 1, 8, 13, 41, 65, 97, 85, 34, 0, 1, 1, 9, 15, 55, 96, 181, 217, 171, 55, 0, 1, 1, 10, 17, 71, 133, 301, 441, 508, 341, 89, 0, 1, 1, 11

Offset: 0

Roger L. Bagula and Gary W. Adamson, Jan 29 2010

Transposed variant of A083856, without the top row of A083856.
Antidiagonal sums are (0, 1, 2, 4, 8, 16, 33, 70, 153, 345, ...) = (A110113(n) - 1: n >= 1).
Characteristic polynomials for columns are y^2 - y - k.

			Array T(n,k) (with rows n >= 0 and columns k >= 1) begins as follows:
    0,    0,    0,    0,    0,     0,     0,     0,     0,     0, ...
    1,    1,    1,    1,    1,     1,     1,     1,     1,     1, ...
    1,    1,    1,    1,    1,     1,     1,     1,     1,     1, ...
    2,    3,    4,    5,    6,     7,     8,     9,    10,    11, ...
    3,    5,    7,    9,   11,    13,    15,    17,    19,    21, ...
    5,   11,   19,   29,   41,    55,    71,    89,   109,   131, ...
    8,   21,   40,   65,   96,   133,   176,   225,   280,   341, ...
   13,   43,   97,  181,  301,   463,   673,   937,  1261,  1651, ...
   21,   85,  217,  441,  781,  1261,  1905,  2737,  3781,  5061, ...
   34,  171,  508, 1165, 2286,  4039,  6616, 10233, 15130, 21571, ...
   55,  341, 1159, 2929, 6191, 11605, 19951, 32129, 49159, 72181, ...
   ...

Cf. A083856, A110113, A193376.

A172237 := proc(n,k)
        if n = 0 then
                0;
        elif n <=2 then
                1 ;
        else
                procname(n-1,k)+k*procname(n-2,k) ;
        end if;
end proc: # R. J. Mathar, Jul 05 2012

f[0, a_] := 0; f[1, a_] := 1;
f[n_, a_] := f[n, a] = f[n - 1, a] + a*f[n - 2, a];
m1 = Table[f[n, a], {n, 0, 10}, {a, 1, 11}];
Table[Table[m1[[m, n - m + 1]], {m, 1, n}], {n, 1, 10}];
Flatten[%]

More terms from Petros Hadjicostas, Dec 26 2019

cp's OEIS Frontend

A083859 Main diagonal of generalized Fibonacci array A083856.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

A083860 First subdiagonal of generalized Fibonacci array A083856.

Views

Author

Keywords

Crossrefs

Programs

Maple

Mathematica

Formula

A110113 Diagonal sums of A083856.

Views

Author

Keywords

Comments

Links

Programs

Maple

Formula

A193376 T(n,k) = number of ways to place any number of 2 X 1 tiles of k distinguishable colors into an n X 1 grid; array read by descending antidiagonals, with n, k >= 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

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

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

Extensions

A110112 Square array of numbers associated to the recurrences b(k) = b(k-1) + n*b(k-2); array T(n,k), read by descending antidiagonals, for n, k >= 0.

Views

Author

Keywords

Comments

Examples

Crossrefs