A011245 -id:A011245 - cp's OEIS frontend

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

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

Philippe Deléham, Jun 01 2015

A variant of A142589.

			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

G. C. Greubel, Antidiagonal rows n = 0..100, flattened

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

Flat(List([0..12], n-> List([0..n], k-> Product([0..n-k-1], j-> j*k+1) ))); # G. C. Greubel, Mar 04 2020

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

seq(seq( mul(j*k+1, j=0..n-k-1), k=0..n), n=0..12); # G. C. Greubel, Mar 04 2020

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

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

[[ 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

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

A142589 Square array T(n,m) = Product_{i=0..m} (1+n*i) read by antidiagonals.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 6, 3, 1, 1, 24, 15, 4, 1, 1, 120, 105, 28, 5, 1, 1, 720, 945, 280, 45, 6, 1, 1, 5040, 10395, 3640, 585, 66, 7, 1, 1, 40320, 135135, 58240, 9945, 1056, 91, 8, 1, 1, 362880, 2027025, 1106560, 208845, 22176, 1729, 120, 9, 1, 1, 3628800, 34459425, 24344320, 5221125, 576576, 43225, 2640, 153, 10, 1

Offset: 0

Roger L. Bagula and Gary W. Adamson, Sep 22 2008

Antidiagonal sums are {1, 2, 4, 11, 45, 260, 1998, 19735, 244797, 3729346, 68276276, ...}.

			The transpose of the array is:
    1,    1,     1,     1,      1,      1,      1,      1,     1,
    1,    2,     3,     4,      5,      6,      7,      8,     9,
    1,    6,    15,    28,     45,     66,     91,     120,   153, ... A000384
    1,   24,   105,   280,    585,   1056,   1729,    2640,  3825, ... A011199
    1,  120,   945,  3640,   9945,  22176,  43225,   76560, 126225,... A011245
    1,  720, 10395, 58240, 208845, 576576, 1339975, 2756160,...
        /      |       \       \
   A000142  A001147  A007559  A007696

G. C. Greubel, Antidiagonal rows n = 0..100, flattened

Cf. A000142, A006882(2n-1) = A001147, A007661(3n-2) = A007559, A007662(4n-3) = A007696, A153274.

function T(n,k)
  if k eq 0 or n eq 0 then return 1;
  else return (&*[j*k+1: j in [0..n]]);
  end if; return T; end function;
[T(n-k,k): k in [0..n], n in [0..12]]; // G. C. Greubel, Mar 05 2020

T:= (n, k)-> `if`(n=0, 1, mul(j*k+1, j=0..n)):
seq(seq(T(n-k, k), k=0..n), n=0..12); # G. C. Greubel, Mar 05 2020

T[n_, k_]= If[n==0, 1, Product[1 + k*i, {i,0,n}]]; Table[T[n-k, k], {n,0,10}, {k,0,n}]//Flatten

T(n, k) = if(n==0, 1, prod(j=0, n, j*k+1) );
for(n=0, 12, for(k=0, n, print1(T(n-k, k), ", "))) \\ G. C. Greubel, Mar 05 2020

def T(n, k):
    if (k==0 and n==0): return 1
    else: return product(j*k+1 for j in (0..n))
[[T(n-k, k) for k in (0..n)] for n in (0..12)] # G. C. Greubel, Mar 05 2020

Edited by M. F. Hasler, Oct 28 2014

More terms added by G. C. Greubel, Mar 05 2020

A033593 a(n) = (n-1)(2n-1)(3n-1)(4n-1).

Original entry on oeis.org

1, 0, 105, 880, 3465, 9576, 21505, 42120, 74865, 123760, 193401, 288960, 416185, 581400, 791505, 1053976, 1376865, 1768800, 2238985, 2797200, 3453801, 4219720, 5106465, 6126120, 7291345, 8615376, 10112025, 11795680, 13681305, 15784440, 18121201, 20708280, 23562945

Offset: 0

N. J. A. Sloane

The sequence of n such that n is prime and (2*n+1) is prime is the sequence of Sophie Germain primes A005384; the subsequence of those for which in addition (3*n+2) is prime is A067256; and the subsequence of those for which in addition (4*n+3) is prime is A067257. - Jonathan Vos Post, Dec 15 2004

G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).

a(n) = A011245(-n).

Cf. A005384, A033594, A067256, A067257.

[ 24*n^4-50*n^3+35*n^2-10*n+1: n in [0..40]]; // Vincenzo Librandi, Jan 30 2011

[&*[s*n-1: s in [1..4]]: n in [0..40]]; // Bruno Berselli, May 23 2011

1, seq( n^4*pochhammer((n-1)/n, 4), n=1..40); # G. C. Greubel, Mar 05 2020

Table[1-10 n+35 n^2-50 n^3+24 n^4,{n,0,40}] (* or *) LinearRecurrence[{5,-10, 10,-5,1}, {1,0,105,880,3465}, 40]  (* Harvey P. Dale, Jan 29 2011 & Apr 26 2011 *)

a(n)=24*n^4-50*n^3+35*n^2-10*n+1 \\ Charles R Greathouse IV, May 23 2011

[1]+[n^4*rising_factorial((n-1)/n, 4) for n in (1..40)] # G. C. Greubel, Mar 05 2020

G.f.: (1 -5*x +115*x^2 +345*x^3 +120*x^4)/(1-x)^5. - R. J. Mathar, Jan 30 2011
From G. C. Greubel, Mar 05 2020: (Start)
a(n) = n^4* Pochhammer((n-1)/n, 4).
E.g.f.: (1 - x + 53*x^2 + 94*x^3 + 24*x^4)*exp(x). (End)
From Amiram Eldar, Mar 11 2022: (Start)
Sum_{n>=2} 1/a(n) = 29/36 + (4/3 - 3*sqrt(3)/4)*Pi - 12*log(2) +  27*log(3)/4.
Sum_{n>=2} (-1)^n/a(n) = (1 + 4*sqrt(2)/3 - 3*sqrt(3)/2)*Pi + 14*log(2)/3 - 4*sqrt(2)*log(2)/3 + 8*sqrt(2)*log(2-sqrt(2))/3 - 29/36. (End)

A368119 Array read by ascending antidiagonals. A(n, k) = Product_{j=0..k-1} (n*j + 1).

Original entry on oeis.org

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

Offset: 0

Peter Luschny, Dec 18 2023

A(n, k) is the number of increasing (n + 1)-ary trees on k vertices. (Following a comment of David Callan in A007559.)

			Array A(n, k) starts:
  [0] 1, 1, 1,   1,    1,      1,       1,         1, ...  A000012
  [1] 1, 1, 2,   6,   24,    120,     720,      5040, ...  A000142
  [2] 1, 1, 3,  15,  105,    945,   10395,    135135, ...  A001147
  [3] 1, 1, 4,  28,  280,   3640,   58240,   1106560, ...  A007559
  [4] 1, 1, 5,  45,  585,   9945,  208845,   5221125, ...  A007696
  [5] 1, 1, 6,  66, 1056,  22176,  576576,  17873856, ...  A008548
  [6] 1, 1, 7,  91, 1729,  43225, 1339975,  49579075, ...  A008542
  [7] 1, 1, 8, 120, 2640,  76560, 2756160, 118514880, ...  A045754
  [8] 1, 1, 9, 153, 3825, 126225, 5175225, 253586025, ...  A045755

Index entries for sequences related to factorial numbers.

Rows: A000012, A000142, A001147, A007559, A007696, A008548, A008542, A045754, A045755.
Columns: A000012, A000027, A000384, A011199, A011245.
Variant: A256268. Main diagonal: A092985.
Cf. A124320, A008279, A326323.

def A(n, k): return n**k * rising_factorial(1/n, k) if n > 0 else 1
for n in range(9): print([A(n, k) for k in range(8)])

Let rf(n, k) denote the rising factorial and ff(n,k) the falling factorial.
A(n, k) = n^k * rf(1/n, k) if n > 0 else 1.
A(n, k) = (-n)^k * ff(-1/n, k) if n > 0 else 1.
A(n, k) = (n^k * Gamma(k + 1/n)) / Gamma(1/n) for n > 0.
A(n, k) = ((-n)^k * Gamma(1 - 1/n)) / Gamma(1 - 1/n - k) for n > 0.
A(n, k) = k! * [x^k](1 - n*x)^(-1/n).
A(n, k) = [x^k] hypergeom([1, 1/n], [], n*x).
Column n + 1 has a linear recurrence with constant coefficients and signature ((-1)^k*binomial(n+1, n-k) for k=0..n).

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

A142589 Square array T(n,m) = Product_{i=0..m} (1+n*i) read by antidiagonals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Extensions

A033593 a(n) = (n-1)*(2*n-1)*(3*n-1)*(4*n-1).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Magma

Maple

Mathematica

PARI

Sage

Formula

A368119 Array read by ascending antidiagonals. A(n, k) = Product_{j=0..k-1} (n*j + 1).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

SageMath

Formula

A033593 a(n) = (n-1)(2n-1)(3n-1)(4n-1).