A082144 -id:A082144 - cp's OEIS frontend

A069723 a(n) = 2^(n-1)binomial(2n-3, n-1).

1, 2, 12, 80, 560, 4032, 29568, 219648, 1647360, 12446720, 94595072, 722362368, 5538111488, 42600857600, 328635187200, 2541445447680, 19696202219520, 152935217233920, 1189496134041600, 9265548833587200, 72271280901980160, 564404288948797440, 4412615349963325440

Offset: 1

Valery A. Liskovets, Apr 07 2002

Number of rooted unicursal planar maps with n edges and two vertices of valency 1 (unicursal means that exactly two vertices are of odd valency; there is an Eulerian path).

G. C. Greubel, Table of n, a(n) for n = 1..1000
Harlan J. Brothers, Pascal's Prism: Supplementary Material.
Valery A. Liskovets and Timothy R. S. Walsh, Enumeration of Eulerian and unicursal planar maps, Discr. Math., 282 (2004), 209-221.

Main diagonal of array A082137.

Cf. A069720, A069721, A069722, A082143, A082144, A082145, A088218.

Z:=(1-sqrt(1-z))*8^n/sqrt(1-z)/2: Zser:=series(Z, z=0, 33): seq(coeff(Zser, z, n), n=0..20); # Zerinvary Lajos, Jan 16 2007

Table[2^(n - 1) * Binomial[2*n - 3, n - 1], {n, 1,50}] (* G. C. Greubel, Jan 15 2017 *)

# Assuming offset 0:
A069723  = lambda n: (rising_factorial(n, n)/factorial(n)) << n
[A069723(n) for n in (0..20)] # Peter Luschny, Nov 30 2014

a(n) = A069722(n)/2, n>1.
G.f.: 4*x/(sqrt(1-8*x) * (1-sqrt(1-8*x))). - Paul Barry, Sep 06 2004
With offset 0: a(n) = (0^n + 2^n*binomial(2n, n))/2. - Paul Barry, Sep 24 2004
D-finite with recurrence (-n+1)*a(n) + 4*(2*n-3)*a(n-1) = 0. - R. J. Mathar, Dec 03 2012
With offset 0: a(n) = 2^n*rf(n,n)/n! = 2^n*A088218(n), where rf denotes the rising factorial. - Peter Luschny, Nov 30 2014
a(n) = Sum_{k=0..n} binomial(n+k-1,k)*binomial(2*n-1, n-k). - Vladimir Kruchinin, Nov 11 2016
a(n) ~ 2^(3*n-4)/sqrt(Pi*n). - Ilya Gutkovskiy, Nov 11 2016
From Amiram Eldar, Jan 16 2024: (Start)
Sum_{n>=1} 1/a(n) = 9/7 + 16*arcsin(1/(2*sqrt(2)))/(7*sqrt(7)).
Sum_{n>=1} (-1)^(n+1)/a(n) = 7/9 - 8*log(2)/27. (End)

A082137 Square array of transforms of binomial coefficients, read by antidiagonals.

Original entry on oeis.org

1, 1, 1, 1, 2, 2, 1, 3, 6, 4, 1, 4, 12, 16, 8, 1, 5, 20, 40, 40, 16, 1, 6, 30, 80, 120, 96, 32, 1, 7, 42, 140, 280, 336, 224, 64, 1, 8, 56, 224, 560, 896, 896, 512, 128, 1, 9, 72, 336, 1008, 2016, 2688, 2304, 1152, 256, 1, 10, 90, 480, 1680, 4032, 6720, 7680, 5760, 2560, 512

Offset: 0

Paul Barry, Apr 06 2003

Rows are associated with the expansions of (x^k/k!)exp(x)cosh(x) (leading zeros dropped). Rows include A011782, A057711, A080929, A082138, A080951, A082139, A082140, A082141. Columns are of the form 2^(k-1)C(n+k, k). Diagonals include A069723, A082143, A082144, A082145, A069720.
T(n, k) is also the number of idempotent order-preserving and order-decreasing partial transformations (of an n-chain) of width k (width(alpha)= |Dom(alpha)|). - Abdullahi Umar, Oct 02 2008
Read as a triangle this is A119468 with rows reversed. A119468 has e.g.f. exp(z*x)/(1-tanh(x)). - Peter Luschny, Aug 01 2012
Read as a triangle this is a subtriangle of A198793. - Philippe Deléham, Nov 10 2013

			Rows begin
  1 1  2   4   8 ...
  1 2  6  16  40 ...
  1 3 12  40 120 ...
  1 4 20  80 280 ...
  1 5 30 140 560 ...
Read as a triangle, this begins:
  1
  1, 1
  1, 2,  2
  1, 3,  6,  4
  1, 4, 12, 16,   8
  1, 5, 20, 40,  40, 16
  1, 6, 30, 80, 120, 96, 32
  ... - _Philippe Deléham_, Nov 10 2013

G. C. Greubel, Table of n, a(n) for the first 50 rows, flattened
Laradji, A. and Umar, A. Combinatorial results for semigroups of order-preserving partial transformations, Journal of Algebra 278, (2004), 342-359.
Laradji, A. and Umar, A. Combinatorial results for semigroups of order-decreasing partial transformations, J. Integer Seq. 7 (2004), 04.3.8.

Cf. A119468, A007318, A134309.

# As a triangular array:
T := (n,k) -> 2^(k+0^k-1)*binomial(n,k):
for n from 0 to 9 do seq(T(n,k), k=0..n) od; # Peter Luschny, Nov 10 2017

rows = 11; t[n_, k_] := 2^(n-1)*(n+k)!/(n!*k!); t[0, ] = 1; tkn = Table[ t[n, k], {k, 0, rows}, {n, 0, rows}]; Flatten[ Table[ tkn[[ n-k+1, k ]], {n, 1, rows}, {k, 1, n}]] (* _Jean-François Alcover, Jan 20 2012 *)

def A082137_row(n) : # as a triangular array
    var('z')
    s = (exp(z*x)/(1-tanh(x))).series(x,n+2)
    t = factorial(n)*s.coefficient(x,n)
    return [t.coefficient(z,n-k) for k in (0..n)]
for n in (0..7) : print(A082137_row(n))  # Peter Luschny, Aug 01 2012

Square array defined by T(n, k)=(2^(n-1)+0^n/2)C(n + k, n)= Sum{k=0..n, C(n+k, k+j)C(k+j, k)(1+(-1)^j)/2 }.
As an infinite lower triangular matrix, equals A007318 * A134309. - Gary W. Adamson, Oct 19 2007
O.g.f. for array read as a triangle: (1-x*(1+t))/((1-x)*(1-x*(1+2*t))) = 1 + x*(1+t) + x^2*(1+2*t+2*t^2) + x^3*(1+3*t+6*t^2+4*t^3) + .... - Peter Bala, Apr 26 2012
For array read as a triangle: T(n,k) = 2*T(n-1,k) + 2*T(n-1,k-1) - T(n-2,k) -2*T(n-2,k-1), T(0,0) = T(1,0) = T(1,1) = 1, T(n,k) = 0 if k<0 or if k>n. - Philippe Deléham, Nov 10 2013

A082143 First subdiagonal of number array A082137.

Original entry on oeis.org

1, 3, 20, 140, 1008, 7392, 54912, 411840, 3111680, 23648768, 180590592, 1384527872, 10650214400, 82158796800, 635361361920, 4924050554880, 38233804308480, 297374033510400, 2316387208396800, 18067820225495040, 141101072237199360, 1103153837490831360

Offset: 0

Paul Barry, Apr 06 2003

			a(0)=(2^(-1)+(0^0)/2)C(1,0)=2*(1/2)=1 (use 0^0=1).

Reinhard Zumkeller, Table of n, a(n) for n = 0..1000

Cf. A069723, A082144, A082145.

Cf. A000079, A001700, A069720.

a082143 0 = 1
a082143 n = (a000079 $ n - 1) * (a001700 n)
-- Reinhard Zumkeller, Jan 15 2015

[(2^(n-1) + 0^n/2)*Binomial(2*n+1,n): n in [0..30]]; // G. C. Greubel, Feb 05 2018

Join[{1}, Table[2^(n-1)* Binomial[2*n+1,n], {n,1,30}]] (* G. C. Greubel, Feb 05 2018 *)

for(n=0,30, print1((2^(n-1) + 0^n/2)*Binomial(2*n+1,n), ", ")) \\ G. C. Greubel, Feb 05 2018

a(n) = (2^(n-1) + 0^n/2)*C(2n+1, n).
Conjecture: (n+1)*a(n) +4*(-2*n-1)*a(n-1)=0. - R. J. Mathar, Oct 19 2014
From Reinhard Zumkeller, Jan 15 2015: (Start)
a(n) = A000079(n-1) * A001700(n), for n > 0.
a(n) = A069720(n+1)/2. (End)
From Amiram Eldar, Jan 16 2024: (Start)
Sum_{n>=0} 1/a(n) = 64*arcsin(1/(2*sqrt(2)))/(7*sqrt(7)) + 1/7.
Sum_{n>=0} (-1)^n/a(n) = 32*log(2)/27 - 1/9. (End)

A082145 A subdiagonal of number array A082137.

Original entry on oeis.org

1, 5, 42, 336, 2640, 20592, 160160, 1244672, 9674496, 75246080, 585761792, 4564377600, 35602145280, 277970595840, 2172375244800, 16992801914880, 133035751833600, 1042374243778560, 8173537721057280, 64136851016908800, 503613708419727360, 3956964851869286400

Offset: 0

Paul Barry, Apr 06 2003

			a(0) = ( 2^(-1)+(0^0)/2 )*C(3,0) = ( 1/2+1/2 )*1 = 1 (use 0^0 = 1). - clarified by _Jon Perry_, Oct 29 2014

G. C. Greubel, Table of n, a(n) for n = 0..1000

Cf. A069723, A082143, A082144.

[(2^(n-1)+(0^n)/2)*Binomial(2*n+3, n): n in [0..30]]; // Vincenzo Librandi, Oct 30 2014

Z:=(1-3*z-sqrt(1-4*z))/sqrt(1-4*z)/64: Zser:=series(Z, z=0, 32): seq(coeff(Zser*2^(n+1), z, n), n=4..23); # Zerinvary Lajos, Jan 01 2007

Join[{1}, Table[2^(n-1)* Binomial[2*n+3,n], {n,1,30}]] (* G. C. Greubel, Feb 05 2018 *)

for(n=0,30, print1((2^(n-1) + 0^n/2)*Binomial(2*n+3,n), ", ")) \\ G. C. Greubel, Feb 05 2018

a(n) = ( 2^(n-1) + (0^n)/2 )*binomial(2*n+3, n).
(n+3)*a(n) +2*(-7*n-13)*a(n-1) +24*(2*n+1)*a(n-2)=0. - R. J. Mathar, Oct 29 2014
From Amiram Eldar, Jan 16 2024: (Start)
Sum_{n>=0} 1/a(n) = 37/7 - 208*arcsin(1/(2*sqrt(2)))/(7*sqrt(7)).
Sum_{n>=0} (-1)^n/a(n) = 296*log(2)/27 - 61/9. (End)

cp's OEIS Frontend

A069723 a(n) = 2^(n-1)*binomial(2*n-3, n-1).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Sage

Formula

A082137 Square array of transforms of binomial coefficients, read by antidiagonals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Sage

Formula

A082143 First subdiagonal of number array A082137.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Haskell

Magma

Mathematica

PARI

Formula

A082145 A subdiagonal of number array A082137.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A069723 a(n) = 2^(n-1)binomial(2n-3, n-1).