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-3 of 3 results.

A256268 Table of k-fold factorials, read by antidiagonals.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 6, 3, 1, 1, 1, 24, 15, 4, 1, 1, 1, 120, 105, 28, 5, 1, 1, 1, 720, 945, 280, 45, 6, 1, 1, 1, 5040, 10395, 3640, 585, 66, 7, 1, 1, 1, 40320, 135135, 58240, 9945, 1056, 91, 8, 1, 1, 1, 362880, 2027025, 1106560, 208845, 22176, 1729, 120, 9, 1, 1
Offset: 0

Views

Author

Philippe Deléham, Jun 01 2015

Keywords

Comments

A variant of A142589.

Examples

			1  1   1    1     1       1         1... A000012
1  1   2    6    24     120       720... A000142
1  1   3   15   105     945     10395... A001147
1  1   4   28   280    3640     58240... A007559
1  1   5   45   585    9945    208845... A007696
1  1   6   66  1056   22176    576576... A008548
1  1   7   91  1729   43225   1339975... A008542
1  1   8  120  2640   76560   2756160... A045754
1  1   9  153  3825  126225   5175225... A045755
1  1  10  190  5320  196840   9054640... A045756
1  1  11  231  7161  293601  14977651... A144773
		

Crossrefs

Cf. Diagonals : A092985, A076111, A158887.
Cf. A000142 ("1-fold"), A001147 (2-fold), A007559 (3), A007696 (4), A008548 (5), A008542 (6), A045754 (7), A045755 (8), A045756 (9), A144773 (10)

Programs

  • GAP
    Flat(List([0..12], n-> List([0..n], k-> Product([0..n-k-1], j-> j*k+1) ))); # G. C. Greubel, Mar 04 2020
  • Magma
    function T(n,k)
      if k eq 0 or n eq 0 then return 1;
      else return (&*[j*k+1: j in [0..n-1]]);
      end if; return T; end function;
    [T(n-k,k): k in [0..n], n in [0..12]]; // G. C. Greubel, Mar 04 2020
    
  • Maple
    seq(seq( mul(j*k+1, j=0..n-k-1), k=0..n), n=0..12); # G. C. Greubel, Mar 04 2020
  • Mathematica
    T[n_, k_]= Product[j*k+1, {j,0,n-1}]; Table[T[n-k,k], {n,0,12}, {k, 0, n}]//Flatten (* G. C. Greubel, Mar 04 2020 *)
  • PARI
    T(n,k) = prod(j=0, n-1, j*k+1);
    for(n=0,12, for(k=0, n, print1(T(n-k, k), ", "))) \\ G. C. Greubel, Mar 04 2020
    
  • Sage
    [[ product(j*k+1 for j in (0..n-k-1)) for k in (0..n)] for n in (0..12)] # G. C. Greubel, Mar 04 2020
    

Formula

A(n, k) = (-n)^k*FallingFactorial(-1/n, k) for n >= 1. - Peter Luschny, Dec 21 2021

A153274 Triangle, read by rows, T(n,k) = k^(n+1) * Pochhammer(1/k, n+1).

Original entry on oeis.org

2, 6, 15, 24, 105, 280, 120, 945, 3640, 9945, 720, 10395, 58240, 208845, 576576, 5040, 135135, 1106560, 5221125, 17873856, 49579075, 40320, 2027025, 24344320, 151412625, 643458816, 2131900225, 5925744000, 362880, 34459425, 608608000, 4996616625, 26381811456, 104463111025, 337767408000, 939536222625
Offset: 1

Views

Author

Roger L. Bagula, Dec 22 2008

Keywords

Comments

A Pochhammer function-based triangular sequence.
Row sums are: {2, 21, 409, 14650, 854776, 73920791, 8878927331, 1413788600036, 288152651134776, 73152069870215127, ...}.

Examples

			Triangle begins as:
      2;
      6,      15;
     24,     105,      280;
    120,     945,     3640,      9945;
    720,   10395,    58240,    208845,    576576;
   5040,  135135,  1106560,   5221125,  17873856,   49579075;
  40320, 2027025, 24344320, 151412625, 643458816, 2131900225, 5925744000;
		

Crossrefs

Programs

  • GAP
    Flat(List([1..12], n-> List([1..n], k-> Product([0..n], j-> j*k+1 )))); # G. C. Greubel, Mar 05 2020
  • Magma
    [(&*[j*k+1: j in [0..n]]): k in [1..n], n in [1..12]]; // G. C. Greubel, Mar 05 2020
    
  • Maple
    seq(seq( k^(n+1)*pochhammer(1/k, n+1), k=1..n), n=1..12); # G. C. Greubel, Mar 05 2020
  • Mathematica
    Table[Apply[Plus, CoefficientList[j*k^n*Pochhammer[(j+k)/k, n], j]], {n, 12}, {k,n}]//Flatten (* modified by G. C. Greubel, Mar 05 2020 *)
    Table[k^(n+1)*Pochhammer[1/k, n+1], {n,12}, {k,n}]//Flatten (* G. C. Greubel, Mar 05 2020 *)
  • PARI
    T(n, k) = prod(j=0, n, j*k+1);
    for(n=1, 12, for(k=1, n, print1(T(n, k), ", "))) \\ G. C. Greubel, Mar 05 2020
    
  • Sage
    [[k^(n+1)*rising_factorial(1/k,n+1) for k in (1..n)] for n in (1..12)] # G. C. Greubel, Mar 05 2020
    

Formula

T(n, k) = k^(n+1) * Pochmammer(1/k, n+1).
T(n, k) = Product_{j=0..n} (j*k + 1). - G. C. Greubel, Mar 05 2020

Extensions

Edited by G. C. Greubel, Mar 05 2020

A153189 Triangle T(n,k) = Product_{j=0..k} n*j+1.

Original entry on oeis.org

1, 1, 2, 1, 3, 15, 1, 4, 28, 280, 1, 5, 45, 585, 9945, 1, 6, 66, 1056, 22176, 576576, 1, 7, 91, 1729, 43225, 1339975, 49579075, 1, 8, 120, 2640, 76560, 2756160, 118514880, 5925744000, 1, 9, 153, 3825, 126225, 5175225, 253586025, 14454403425, 939536222625
Offset: 0

Views

Author

Roger L. Bagula, Dec 20 2008

Keywords

Comments

Row sums are: {1, 3, 19, 313, 10581, 599881, 50964103, 6047094369, 954249517513, 193146844030201, 48762935887310811,...}. [Corrected by M. F. Hasler, Oct 28 2014]
This is the lower left triangle of the array A142589. - M. F. Hasler, Oct 28 2014
Row n is a subset of the n-fold factorial sequence for k=0..n. For example, T(8,0..8) is A045755(1..9). These sequences are listed for n=0..10 in A256268. - Georg Fischer, Feb 15 2020

Examples

			Triangle begins as:
  1;
  1, 2;
  1, 3,  15;
  1, 4,  28,  280;
  1, 5,  45,  585,   9945;
  1, 6,  66, 1056,  22176,  576576;
  1, 7,  91, 1729,  43225, 1339975,  49579075;
  1, 8, 120, 2640,  76560, 2756160, 118514880,  5925744000;
  1, 9, 153, 3825, 126225, 5175225, 253586025, 14454403425, 939536222625;
		

Crossrefs

Cf. A000142 (row 2), A001147 (3), A007559 (4), A007696 (5), A008548 (6), A008542 (7), A045754 (8), A045755 (9), A045756 (10), A144773 (11), A256268 (combined table).

Programs

  • Magma
    [(&*[n*j+1: j in [0..k]]): k in [0..n], n in [0..10]]; // G. C. Greubel, Feb 15 2020
    
  • Maple
    seq(seq(mul(n*j+1, j=0..k), k=0..n), n=0..10); # G. C. Greubel, Feb 15 2020
  • Mathematica
    T[n_, k_]= If[n==0 && k==0, 1, Product[n*j+1, {j,0,k}]]; Table[T[n, k], {n,0,10}, {k,0,n}]//Flatten (* G. C. Greubel, Feb 15 2020 *)
    T[n_, k_]:= T[n, k]= If[k<2, 1+k*n, ((1+n*k)*T[n, k-1] + (1+n*k)*(1+n*(k-1))* T[n, k-2])/2]; Table[T[n, k], {n,0,10}, {k,0,n}]//Flatten (* Georg Fischer, Feb 17 2020 *)
  • PARI
    T(n,k)=prod(j=0,k,n*j+1) \\ M. F. Hasler, Oct 28 2014
    
  • Sage
    [[ product(n*j+1 for j in (0..k)) for k in (0..n)] for n in (0..10)] # G. C. Greubel, Feb 15 2020

Formula

T(n, k) = n^(k+1)*Pochhammer(1/n, k+1).
From Vaclav Kotesovec, Oct 10 2016: (Start)
For fixed n > 0:
T(n, k) ~ sqrt(2*Pi) * n^k * k^(k + 1/2 + 1/n) / (Gamma(1 + 1/n) * exp(k)).
T(n, k) ~ k! * n^k * k^(1/n) / Gamma(1 + 1/n).
(End)
T(n, k) = Sum_{j=0..k+1} (-1)^(k-j+1)*Stirling1(k+1,j)*n^(k-j+1). - G. C. Greubel, Feb 17 2020
T(n, k) = ((1+n*k)*T(n, k-1) + (1+n*k)*(1+n*(k-1))*T(n, k-2))/2. - Georg Fischer, Feb 17 2020

Extensions

Edited and row 0 added by M. F. Hasler, Oct 28 2014
Showing 1-3 of 3 results.