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.

A343849 a(n) = Sum_{k = 0..n} n! * LaguerreL(n, -k).

Original entry on oeis.org

1, 3, 23, 294, 5194, 116620, 3175717, 101696700, 3745365444, 155975005998, 7247927859875, 371803988506742, 20870023274690966, 1272424816703533792, 83736949788656865729, 5916106654032037435800, 446636583718649775483144, 35882981062654529341219962, 3056767877633271802374850239
Offset: 0

Views

Author

Peter Luschny, May 08 2021

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := Sum[n! LaguerreL[n, -k], {k, 0, n}];
    Table[a[n], {n, 0, 18}]
  • PARI
    a(n) = n!*sum(m=0, n, sum(j=0, n, binomial(n, j) * m^j / j!))
    for(n=0, 18, print(a(n)))

Formula

a(n) = (-1)^n * Sum_{k=0..n} KummerU(-n, 1, -k).
a(n) = n! * Sum_{m=0..n} Sum_{j=0..n} binomial(n, j) * m^j / j!.
a(n) ~ exp(n/phi - n) * phi^(2*n+1) * n^n / (5^(1/4) * (1 - exp(-1/phi))), where phi = A001622 = (1+sqrt(5))/2 is the golden ratio. - Vaclav Kotesovec, May 09 2021

A343847 T(n, k) = (n - k)! * [x^(n-k)] exp(k*x/(1 - x))/(1 - x). Triangle read by rows, T(n, k) for 0 <= k <= n.

Original entry on oeis.org

1, 1, 1, 2, 2, 1, 6, 7, 3, 1, 24, 34, 14, 4, 1, 120, 209, 86, 23, 5, 1, 720, 1546, 648, 168, 34, 6, 1, 5040, 13327, 5752, 1473, 286, 47, 7, 1, 40320, 130922, 58576, 14988, 2840, 446, 62, 8, 1, 362880, 1441729, 671568, 173007, 32344, 4929, 654, 79, 9, 1
Offset: 0

Views

Author

Peter Luschny, May 07 2021

Keywords

Examples

			Triangle starts:
0:     1;
1:     1,      1;
2:     2,      2,     1;
3:     6,      7,     3,     1;
4:    24,     34,    14,     4,    1;
5:   120,    209,    86,    23,    5,   1;
6:   720,   1546,   648,   168,   34,   6,  1;
7:  5040,  13327,  5752,  1473,  286,  47,  7,  1;
8: 40320, 130922, 58576, 14988, 2840, 446, 62,  8,  1;
.
Array whose upward read antidiagonals are the rows of the triangle.
n\k   0       1       2        3        4         5        6
-----------------------------------------------------------------
0:    1,      1,      1,       1,       1,        1,        1, ...
1:    1,      2,      3,       4,       5,        6,        7, ...
2:    2,      7,     14,      23,      34,       47,       62, ...
3:    6,     34,     86,     168,     286,      446,      654, ...
4:   24,    209,    648,    1473,    2840,     4929,     7944, ...
5:  120,   1546,   5752,   14988,   32344,    61870,   108696, ...
6:  720,  13327,  58576,  173007,  414160,   866695,  1649232, ...
7: 5040, 130922, 671568, 2228544, 5876336, 13373190, 27422352, ...
		

Crossrefs

Row sums: A343848. T(2*n, n) = A277373(n). Variant: A289192.
Cf. A021009 (Laguerre polynomials), A344048.

Programs

  • Maple
    T := proc(n, k) option remember;
    if n = k then return 1 elif n = k+1 then return k+1 fi;
    (2*n-k-1)*T(n-1, k) - (n-k-1)^2*T(n-2, k) end:
    seq(print(seq(T(n ,k), k = 0..n)), n = 0..7);
  • Mathematica
    T[n_, k_] := (-1)^(n - k) HypergeometricU[k - n, 1, -k];
    Table[T[n, k], {n, 0, 9}, {k, 0, n}] // Flatten
    (* Alternative: *)
    TL[n_, k_] := (n - k)! LaguerreL[n - k, -k];
    Table[TL[n, k], {n, 0, 9}, {k, 0, n}] // Flatten
  • PARI
    T(n, k) = (n - k)!*sum(j=0, n - k, binomial(n - k, j) * k^j / j!)
    for(n=0, 9, for(k=0, n, print(T(n, k))))
    
  • SageMath
    # Columns of the array.
    def column(k, len):
        R. = PowerSeriesRing(QQ, default_prec=len)
        f = exp(k * x / (1 - x)) / (1 - x)
        return f.egf_to_ogf().list()
    for col in (0..6): print(column(col, 20))

Formula

T(n, k) = (-1)^(n - k)*U(k - n, 1, -k), where U is the Kummer U function.
T(n, k) = (n - k)! * L(n - k, -k), where L is the Laguerre polynomial function.
T(n, k) = (n - k)! * Sum_{j = 0..n - k} binomial(n - k, j) k^j / j!.
T(n, k) = (2*n-k-1)*T(n-1, k) - (n-k-1)^2*T(n-2, k) for n - k >= 2.
Showing 1-2 of 2 results.