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.

A203517 a(n) = A203516(n)/A000178(n).

Original entry on oeis.org

1, 4, 96, 15360, 17203200, 138726604800, 8203736501452800, 3603868630142209228800, 11873738053102139590311936000, 295578185800614925763054760099840000, 55920479534877093093661639943174183976960000
Offset: 1

Views

Author

Clark Kimberling, Jan 03 2012

Keywords

Links

Crossrefs

Cf. A000178, A000217, A034910, A093883, A203516.

Programs

  • Magma
    [2^Binomial(n,2)*(&*[Binomial(2*k,k): k in [0..n-1]]): n in [1..20]]; // G. C. Greubel, Feb 19 2024
  • Mathematica
    f[j_] := 2 j - 1; z = 15;
v[n_] := Product[Product[f[k] + f[j], {j, 1, k - 1}], {k, 2, n}]
d[n_] := Product[(i - 1)!, {i, 1, n}]   (* A000178 *)
Table[v[n], {n, 1, z}]                  (* A203516 *)
Table[v[n + 1]/(4 v[n]), {n, 1, z - 1}] (* A034910 *)
Table[v[n]/d[n], {n, 1, 20}]            (* A203517 *)
Table[2^(-1/24 - 3*n/2 + 3*n^2/2) * Glaisher^(3/2) * Pi^(1/4 - n/2) * BarnesG[1/2 + n] / E^(1/8) / BarnesG[1 + n], {n, 1, 12}] (* Vaclav Kotesovec, Sep 01 2023 *)
  • SageMath
    [2^binomial(n,2)*product(binomial(2*k,k) for k in range(n)) for n in range(1,21)] # G. C. Greubel, Feb 19 2024

Formula

a(n) ~ A^(3/2) * 2^(-7/24 - 3*n/2 + 3*n^2/2) * exp(-1/8 + n/2) * n^(1/8 - n/2) / Pi^(n/2), where A = A074962 is the Glaisher-Kinkelin constant. - Vaclav Kotesovec, Sep 01 2023
a(n) = 2^binomial(n,2) * Product_{j=0..n-1} binomial(2*j, j). - G. C. Greubel, Feb 19 2024

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

Original entry on oeis.org

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

Views

Author

Amarnath Murthy, Apr 22 2004

Keywords

Comments

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)

Examples

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

References

  • 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.

Links

Crossrefs

Cf. A006963, A093884, A203469.

Programs

  • Maple
    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
  • Mathematica
    f[n_] := Product[(j + k), {k, 2, n}, {j, 1, k - 1}]; Array[f, 10] (* Robert G. Wilson v, Jan 08 2013 *)
  • PARI
    A093883(n)=prod(i=1,n,(2*i-1)!/i!)  \\ M. F. Hasler, Nov 02 2012

Formula

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

Extensions

More terms from Vladeta Jovovic, May 27 2004

A034910 One quarter of octo-factorial numbers.

Original entry on oeis.org

1, 12, 240, 6720, 241920, 10644480, 553512960, 33210777600, 2258332876800, 171633298636800, 14417197085491200, 1326382131865190400, 132638213186519040000, 14324927024144056320000, 1661691534800710533120000, 206049750315288106106880000
Offset: 1

Views

Author

Wolfdieter Lang

Keywords

Comments

A034910 occurs in connection with the Vandermonde permanent of (1,3,5,7,9,...); see the Mathematica section of A203516. - Clark Kimberling, Jan 03 2012

Examples

			G.f. = x + 12*x^2 + 240*x^3 + 6720*x^4 + 241920*x^5 + 10644480*x^6 + ...

Links

Crossrefs

Cf. A001147, A045755, A034908, A034909, A034911, A034912, A203516.

Programs

  • Magma
    [n le 2 select 12^(n-1) else (7*n-3)*Self(n-1) +4*(n-1)*(2*n-3)*Self(n-2): n in [1..30]]; // G. C. Greubel, Oct 20 2022
  • Maple
    [seq((2*n)!/(n)!*2^(n-2), n=1..14)]; # Zerinvary Lajos, Sep 25 2006
  • Mathematica
    s=1;lst={s};Do[s+=n*s;AppendTo[lst, s], {n, 11, 5!, 8}];lst (* Vladimir Joseph Stephan Orlovsky, Nov 08 2008 *)
a[ n_] := Pochhammer[ 1/2, n] 8^n / 4; (* Michael Somos, Feb 04 2015 *)
  • PARI
    {a(n) = if( n==1, 1, n>1, a(n-1) * (8*n - 4), a(n+1) / (8*n + 4))}; /* Michael Somos, Feb 04 2015 */
  • SageMath
    [2^(3*n-2)*rising_factorial(1/2, n) for n in range(1,40)] # G. C. Greubel, Oct 20 2022

Formula

4*a(n) = (8*n-4)(!^8) = Product_{j=1..n} (8*j-4) = 4^n*A001147(n) = 2^n*(2*n)!/n!, A001147(n) = (2*n-1)!!.
E.g.f. (-1+(1-8*x)^(-1/2))/4.
a(n) = A090802(2n-1, n). - Ross La Haye, Oct 18 2005
a(n) = ((2*n)!/n!)*2^(n-2). - Zerinvary Lajos, Sep 25 2006
G.f.: x/(1-12*x/(1-8*x/(1-20*x/(1-16*x/(1-28*x/(1-24*x/(1-36*x/(1-32*x/(1-... (continued fraction). - Philippe Deléham, Jan 07 2011
From Peter Bala, Feb 01 2015: (Start)
Recurrence equation: a(n) = (7*n - 3)*a(n-1) + 4*(n - 1)*(2*n - 3)*a(n-2).
The sequence b(n) := a(n)* Sum_{k = 0..n-1} (-1)^k/( 2^k*(2*k + 1)*binomial(2*k,k) ) beginning [1, 11, 222, 6210, 223584, ...] satisfies the same recurrence. This leads to the finite continued fraction expansion b(n)/a(n) = 1/(1 + 1/(11 + 24/(18 + 60/(25 + ... + 4*(n - 1)*(2*n - 3)/(7*n - 3) )))) for n >= 3.
Letting n tend to infinity gives the continued fraction expansion Sum_{k>=0} (-1)^k/( 2^k*(2*k + 1)*binomial(2*k,k) ) = (4/3)*log(2) = 1/(1 + 1/(11 + 24/(18 + 60/(25 + ... + 4*(n - 1)*(2*n - 3)/((7*n - 3) + ... ))))). (End)
From Peter Bala, Feb 03 2015: (Start)
This sequence satisfies several other second order recurrence equations leading to some continued fraction expansions.
1) a(n) = (9*n + 4)*a(n-1) - 4*n*(2*n - 1)*a(n-2).
This recurrence is also satisfied by the (integer) sequence c(n) := a(n)*Sum_{k = 0..n} 1/( 2^k*(2*k + 1)*binomial(2*k,k) ). From this we can obtain the continued fraction expansion Sum_{k >= 0} 1/( 2^k*(2*k + 1)*binomial(2*k,k) ) = (8/sqrt(7))*arctan(sqrt(7)/7) = (8/sqrt(7))*A195699 = 1 + 1/(12 - 24/(22 - 60/(31 - ... - 4*n*(2*n - 1)/((9*n + 4) - ... )))).
2) a(n) = (12*n + 2)*a(n-1) - 8*(2*n - 1)^2*a(n-2).
This recurrence is also satisfied by the (integer) sequence d(n) := a(n)*Sum_{k = 0..n} 1/( (2*k + 1)*2^k ). From this we can obtain the continued fraction expansion Sum_{k >= 0} 1/( (2*k + 1)*2^k ) = (1/sqrt(2))*log(3 + 2*sqrt(2)) = 1 + 2/(12 - 8*3^2/(26 - 8*5^2/(38 - ... - 8*(2*n - 1)^2/((12*n + 2) - ... )))). Cf. A002391.
3) a(n) = (4*n + 6)*a(n-1) + 8*(2*n - 1)^2*a(n-2).
This recurrence is also satisfied by the (integer) sequence e(n) := a(n)*Sum_{k = 0..n} (-1)^k/( (2*k + 1)*2^k ). From this we can obtain the continued fraction expansion Sum_{k >= 0} (-1)^k/( (2*k + 1)*2^k ) = (1/sqrt(2))*arctan(sqrt(2)/2) = 1 - 2/(12 + 8*3^2/(14 + 8*5^2/(18 + ... + 8*(2*n - 1)^2/((4*n + 6) + ... )))). Cf. A073000. (End)
a(n) = (-1)^n / (16*a(-n)) for all n in Z. - Michael Somos, Feb 04 2015
From Amiram Eldar, Jan 08 2022: (Start)
Sum_{n>=1} 1/a(n) = e^(1/8)*sqrt(2*Pi)*erf(1/(2*sqrt(2))), where erf is the error function.
Sum_{n>=1} (-1)^(n+1)/a(n) = e^(-1/8)*sqrt(2*Pi)*erfi(1/(2*sqrt(2))), where erfi is the imaginary error function. (End)
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.