A093884 -id:A093884 - cp's OEIS frontend

A093883 Product of all possible sums of two distinct numbers taken from among first n natural numbers.

1, 3, 60, 12600, 38102400, 2112397056000, 2609908810629120000, 84645606509847871488000000, 82967862872337478796810649600000000, 2781259372192376861719959017613164544000000000

Offset: 1

Amarnath Murthy, Apr 22 2004

nonn

From Clark Kimberling, Jan 02 2013: (Start)
Each term divides its successor, as in A006963, and by the corresponding superfactorial, A000178(n), as in A203469.
Abbreviate "Vandermonde" as V. The V permanent of a set S={s(1),s(2),...,s(n)} is a product of sums s(j)+s(k) in analogy to the V determinant as a product of differences s(k)-s(j). Let D(n) and P(n) denote the V determinant and V permanent of S, and E(n) the V determinant of the numbers s(1)^2, s(2)^2, ..., s(n)^2; then P(n) = E(n)/D(n). This is one of many divisibility properties associated with V determinants and permanents. Another is that if S consists of distinct positive integers, then D(n) divides D(n+1) and P(n) divides P(n+1).
Guide to related sequences:
...
s(n).............. D(n)....... P(n)
n................. A000178.... (this)
n+1............... A000178.... A203470
n+2............... A000178.... A203472
n^2............... A202768.... A203475
2^(n-1)........... A203303.... A203477
2^n-1............. A203305.... A203479
n!................ A203306.... A203482
n(n+1)/2.......... A203309.... A203511
Fibonacci(n+1).... A203311.... A203518
prime(n).......... A080358.... A203521
odd prime(n)...... A203315.... A203524
nonprime(n)....... A203415.... A203527
composite(n)...... A203418.... A203530
2n-1.............. A108400.... A203516
n+floor(n/2)...... A203430
n+floor[(n+1)/2].. A203433
1/n............... A203421
1/(n+1)........... A203422
1/(2n)............ A203424
1/(2n+2).......... A203426
1/(3n)............ A203428
Generalizing, suppose that f(x,y) is a function of two variables and S=(s(1),s(2),...s(n)). The phrase, "Vandermonde sequence using f(x,y) applied to S" means the sequence a(n) whose n-th term is the product f(s(j,k)) : 1<=j...
If f(x,y) is a (bivariate) cyclotomic polynomial and S is a strictly increasing sequence of positive integers, then a(n) consists of integers, each of which divides its successor. Guide to sequences for which f(x,y) is x^2+xy+y^2 or x^2-xy+y^2 or x^2+y^2:
...
s(n) ............ x^2+xy+y^2.. x^2-xy+y^2.. x^2+y^2
n ............... A203012..... A203312..... A203475
n+1 ............. A203581..... A203583..... A203585
2n-1 ............ A203514..... A203587..... A203589
n^2 ............. A203673..... A203675..... A203677
2^(n-1) ......... A203679..... A203681..... A203683
n! .............. A203685..... A203687..... A203689
n(n+1)/2 ........ A203691..... A203693..... A203695
Fibonacci(n) .... A203742..... A203744..... A203746
Fibonacci(n+1) .. A203697..... A203699..... A203701
prime(n) ........ A203703..... A203705..... A203707
floor(n/2) ...... A203748..... A203752..... A203773
floor((n+1)/2) .. A203759..... A203763..... A203766
For f(x,y)=x^4+y^4, see A203755 and A203770. (End)

			a(4) = (1+2)*(1+3)*(1+4)*(2+3)*(2+4)*(3+4) = 12600.

Amarnath Murthy, Another combinatorial approach towards generalizing the AM-GM inequality, Octagon Mathematical Magazine, Vol. 8, No. 2, October 2000.
Amarnath Murthy, Smarandache Dual Symmetric Functions And Corresponding Numbers Of The Type Of Stirling Numbers Of The First Kind. Smarandache Notions Journal, Vol. 11, No. 1-2-3 Spring 2000.

T. D. Noe, Table of n, a(n) for n = 1..20

Cf. A006963, A093884, A203469.

a:= n-> mul(mul(i+j, i=1..j-1), j=2..n):
seq(a(n), n=1..12);  # Alois P. Heinz, Jul 23 2017

f[n_] := Product[(j + k), {k, 2, n}, {j, 1, k - 1}]; Array[f, 10] (* Robert G. Wilson v, Jan 08 2013 *)

A093883(n)=prod(i=1,n,(2*i-1)!/i!)  \\ M. F. Hasler, Nov 02 2012

Partial products of A006963: a(n) = Product((2*i-1)!/i!, i=1..n). - Vladeta Jovovic, May 27 2004
G.f.: G(0)/(2*x) -1/x, where G(k)= 1  + 1/(1 - 1/(1 + 1/((2*k+1)!/(k+1)!)/x/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, Jun 15 2013
a(n) ~ sqrt(A/Pi) * 2^(n^2 + n/2 - 7/24) * exp(-3*n^2/4 + n/2 - 1/24) * n^(n^2/2 - n/2 - 11/24), where A is the Glaisher-Kinkelin constant A074962. - Vaclav Kotesovec, Jan 26 2019

More terms from Vladeta Jovovic, May 27 2004

A306594 a(n) = Product_{i=1..n, j=1..n, k=1..n} (i + j + k).

Original entry on oeis.org

1, 3, 144000, 455282248974336000000, 9608917807566747651759509633033255126040576000000000000

Offset: 0

Vaclav Kotesovec, Feb 27 2019

nonn

Next term is too long to be included.

Cf. A079478, A093884, A112332, A324425, A368722, A368723, A324441.

a:= n-> mul(mul(mul(i+j+k, i=1..n), j=1..n), k=1..n):
seq(a(n), n=0..5);  # Alois P. Heinz, Jun 24 2023

Table[Product[i+j+k, {i, 1, n}, {j, 1, n}, {k, 1, n}], {n, 1, 6}]
Table[Product[k^(3*(n - k + 1) (n - k + 2)/2), {k, 1, n}] * Product[k^((3*n - k + 1) (3*n - k + 2)/2), {k, 1, 3*n}] / Product[k^(3*(2*n - k + 1) (2*n - k + 2)/2), {k, 1, 2*n}], {n, 1, 6}]
Clear[a]; a[n_] := a[n] = If[n == 1, 3, 3*n*a[n-1] * BarnesG[2+n]^3 * BarnesG[2+3*n]^3 * Gamma[1+2*n]^3 / (BarnesG[2+2*n]^6 * Gamma[1+3*n]^3)]; Table[a[n], {n, 1, 6}] (* Vaclav Kotesovec, Mar 28 2019 *)

a(n) = Product_{k=1..n} (BarnesG(k+2) * BarnesG(2*n+k+2) / BarnesG(n+k+2)^2).
a(n) = Product_{k=1..n} (k^(3*(n - k + 1)*(n - k + 2)/2)) * Product_{k=1..3*n} (k^((3*n - k + 1)*(3*n - k + 2)/2)) / Product_{k=1..2*n} (k^(3*(2*n - k + 1)*(2*n - k + 2)/2)).
a(n) ~ sqrt(Pi) * 3^(9*n^3/2 + 27*n^2/4 + 3*n + 3/8) * n^(n^3 + 3/8) / (A^(3/2) * 2^(4*n^3 + 9*n^2 + 6*n + 5/8) * exp(11*n^3/6 - Zeta(3)/(8*Pi^2) - 1/8)), where A is the Glaisher-Kinkelin constant A074962.

a(0)=1 prepended by Alois P. Heinz, Jun 24 2023

A093885 a(n) = floor( {product of all possible sums of (n-1) numbers chosen from among first n numbers} / {sum of all possible products of (n-1) numbers chosen from among first n numbers} ).

Original entry on oeis.org

0, 0, 5, 60, 876, 15820, 342490, 8659697, 250596841, 8170355939, 296392500231, 11842341000706, 516766134975841, 24454542316972336, 1247414741568401188, 68231675778495540368, 3983959314088980184276, 247324089280835008754847

Offset: 1

Amarnath Murthy, Apr 22 2004

nonn

The denominator is given by A000254(n).

			a(1) = 1, a(2) = floor((1*2)/(1+2)) = 1, a(3) = floor((1+2)*(1+3)*(2+3)/(1*2+1*3+2*3)) = floor(60/11) = 5.

Amarnath Murthy, Another combinatorial approach towards generalizing the AM-GM inequality, Octogon Mathematical Magazine Vol. 8, No. 2, October 2000.
Amarnath Murthy, Smarandache Dual Symmetric Functions And Corresponding Numbers Of The Type Of Stirling Numbers Of The First Kind. Smarandache Notions Journal Vol. 11, No. 1-2-3 Spring 2000.

Cf. A093883, A093884, A000254.

Do[l = Select[Subsets[Range[n]], Length[ # ]==n-1&]; a = Times @@ Map[Plus @@ #&, l]; b = Plus @@ Map[Times @@ #&, l]; Print[Floor[a/b]], {n, 1, 20}] (* Ryan Propper, Sep 28 2006 *)

More terms from Ryan Propper, Sep 28 2006

Showing 1-3 of 3 results.

cp's OEIS Frontend

A093883 Product of all possible sums of two distinct numbers taken from among first n natural numbers.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A306594 a(n) = Product_{i=1..n, j=1..n, k=1..n} (i + j + k).

Views

Author

Keywords

Comments

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A093885 a(n) = floor( {product of all possible sums of (n-1) numbers chosen from among first n numbers} / {sum of all possible products of (n-1) numbers chosen from among first n numbers} ).

Views

Author

Keywords

Comments

Examples

References

Crossrefs

Programs

Mathematica

Extensions