A177145 -id:A177145 - cp's OEIS frontend

A005359 a(n) = n! if n is even, otherwise 0 (from Taylor series for cos x).

1, 0, 2, 0, 24, 0, 720, 0, 40320, 0, 3628800, 0, 479001600, 0, 87178291200, 0, 20922789888000, 0, 6402373705728000, 0, 2432902008176640000, 0, 1124000727777607680000, 0, 620448401733239439360000, 0

Offset: 0

N. J. A. Sloane, Russ Cox

nonn

Normally sequences like this are not included, since with the alternating 0's deleted it is already in the database.
Stirling transform of a(n)=[0,2,0,24,0,720,...] is A052841(n)=[0,2,6,38,270,...]. - Michael Somos, Mar 04 2004
Stirling transform of a(n-1)=[1,0,2,0,24,0,...] is A000670(n-1)=[1,1,3,13,75,...]. - Michael Somos, Mar 04 2004
Stirling transform of a(n-1)=[0,0,2,0,24,0,...] is A052875(n-1)=[0,0,2,12,74,...]. - Michael Somos, Mar 04 2004
Stirling transform of (-1)^n*A052811(n)=[0,2,-6,46,-340,...] is a(n)=[0,2,0,24,0,...]. - Michael Somos, Mar 04 2004
Also n-th derivative of arctanh(x) at x=0. - Michel Lagneau, Aug 13 2012
Binomial convolution square of A177145 (with offset 0) because each permutation in S_{2n} uniquely determines a bi-partition of its elements into even and odd cycles and these are both enumerated by A177145. - Michael Somos, Mar 19 2019

Douglas Hofstadter, "Fluid Concepts and Creative Analogies: Computer Models of the Fundamental Mechanisms of Thought".

Vincenzo Librandi, Table of n, a(n) for n = 0..200
Michael Somos, Number of permutations with all cycles of even length, answer to Mathematics Stack Exchange question 3152701, Mar 18 2019.
Index entries for sequences related to factorial numbers

From Johannes W. Meijer, Nov 12 2009: (Start)
Equals the first right hand column of A167565.
Equals the first left hand column of A167568.
(End)
Cf. A177145.
Bisection (even part) gives A010050.

BB:={E=Prod(Z,Z),S=Union(Epsilon,Prod(S,E))}: ZL:=[S,BB, labeled]: > seq(count(ZL,size=n),n=0..25); # Zerinvary Lajos, Apr 22 2007
a:=n->n!+(-1)^n*n!: seq(a(n)/2, n=0..25); # Zerinvary Lajos, Mar 25 2008

Riffle[Range[0,30,2]!,0] (* Harvey P. Dale, Nov 16 2011 *)
a[ n_] := If[n >= 0 && EvenQ[n], n!, 0]; (* Michael Somos, Mar 19 2019 *)

{a(n) = if(n<0, 0, if(n%2, 0, n!))}; /* Michael Somos, Mar 04 2004 */

E.g.f. 1/(1-x^2) = d/dx log(sqrt((1+x)/(1-x))). a(2n)=(2n)!, a(2n+1)=0. - Michael Somos, Mar 04 2004
a(n) = Product_{k=0..n/2-1} binomial(n-2k,2)*2^(n/2) for even n. - Geoffrey Critzer, Jun 05 2016
From Ilya Gutkovskiy, Jun 05 2016: (Start)
D-finite with recurrence a(n) = n*(n - 1)*a(n-2), a(0)=1, a(1)=0.
a(n) = n!*((-1)^n + 1)/2. (End)

A274760 The multinomial transform of A001818(n) = ((2*n-1)!!)^2.

Original entry on oeis.org

1, 1, 10, 478, 68248, 21809656, 13107532816, 13244650672240, 20818058883902848, 48069880140604832128, 156044927762422185270016, 687740710497308621254625536, 4000181720339888446834235653120, 29991260979682976913756629498334208

Offset: 0

Johannes W. Meijer, Jul 27 2016

nonn

The multinomial transform [MNL] transforms an input sequence b(n) into the output sequence a(n). Given the fact that the structure of the a(n) formulas, see the examples, lead to the multinomial coefficients A036039 the MNL transform seems to be an appropriate name for this transform. The multinomial transform is related to the exponential transform, see A274804 and the third formula. For the inverse multinomial transform [IML] see A274844.
To preserve the identity IML[MNL[b(n)]] = b(n) for n >= 0 for a sequence b(n) with offset 0 the shifted sequence b(n-1) with offset 1 has to be used as input for the MNL, otherwise information about b(0) will be lost in transformation.
In the a(n) formulas, see the examples, the multinomial coefficients A036039 appear.
We observe that a(0) = 1 and that this term provides no information about any value of b(n), this notwithstanding we will start the a(n) sequence with a(0) = 1.
The Maple programs can be used to generate the multinomial transform of a sequence. The first program uses the first formula which was found by Paul D. Hanna, see A158876, and Vladimir Kruchinin, see A215915. The second program uses properties of the e.g.f., see the sequences A158876, A213507, A244430 and A274539 and the third formula. The third program uses information about the inverse multinomial transform, see A274844.
Some MNL transform pairs are, n >= 1: A000045(n) and A244430(n-1); A000045(n+1) and A213527(n-1); A000108(n) and A213507(n-1); A000108(n-1) and A243953(n-1); A000142(n) and A158876(n-1); A000203(n) and A053529(n-1); A000110(n) and A274539(n-1); A000041(n) and A215915(n-1); A000035(n-1) and A177145(n-1); A179184(n) and A038205(n-1); A267936(n) and A000266(n-1); A267871(n) and A000090(n-1); A193356(n) and A088009(n-1).

			Some a(n) formulas, see A036039:
  a(0) = 1
  a(1) = 1*x(1)
  a(2) = 1*x(2) + 1*x(1)^2
  a(3) = 2*x(3) + 3*x(1)*x(2) + 1*x(1)^3
  a(4) = 6*x(4) + 8*x(1)*x(3) + 3*x(2)^2 + 6*x(1)^2*x(2) + 1*x(1)^4
  a(5) = 24*x(5) + 30*x(1)*x(4) + 20*x(2)*x(3) + 20*x(1)^2*x(3) + 15*x(1)*x(2)^2 + 10*x(1)^3*x(2) + 1*x(1)^5

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 1995, pp. 18-23.

M. Bernstein and N. J. A. Sloane, Some Canonical Sequences of Integers, arXiv:math/0205301 [math.CO], 2002; Linear Algebra and its Applications, Vol. 226-228 (1995), pp. 57-72. Erratum 320 (2000), 210. [Link to arXiv version]
M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to Lin. Alg. Applic. version together with omitted figures]
N. J. A. Sloane, Transforms.
Eric W. Weisstein MathWorld, Exponential Transform.

Cf. A274844, A274804, A036039, A001818, A001316, A215915, A008279.
Cf. A244430, A213527, A213507, A243953, A158876, A274539, A215915.
Cf. A090998, A008298, A271703, A112302, A135002, A274540.

nmax:= 13: b := proc(n): (doublefactorial(2*n-1))^2 end: a:= proc(n) option remember: if n=0 then 1 else add(((n-1)!/(n-k)!) * b(k) * a(n-k), k=1..n) fi: end: seq(a(n), n = 0..nmax); # End first MNL program.
nmax:=13: b := proc(n): (doublefactorial(2*n-1))^2 end: t1 := exp(add(b(n)*x^n/n, n = 1..nmax+1)): t2 := series(t1, x, nmax+1): a := proc(n): n!*coeff(t2, x, n) end: seq(a(n), n = 0..nmax); # End second MNL program.
nmax:=13: b := proc(n): (doublefactorial(2*n-1))^2 end: f := series(log(1+add(s(n)*x^n/n!, n=1..nmax)), x, nmax+1): d := proc(n): n*coeff(f, x, n) end: a(0) := 1: a(1) := b(1): s(1) := b(1): for n from 2 to nmax do s(n) := solve(d(n)-b(n), s(n)): a(n):=s(n): od: seq(a(n), n=0..nmax); # End third MNL program.

b[n_] := (2*n - 1)!!^2;
a[0] = 1; a[n_] := a[n] = Sum[((n-1)!/(n-k)!)*b[k]*a[n-k], {k, 1, n}];
Table[a[n], {n, 0, 13}] (* Jean-François Alcover, Nov 17 2017 *)

a(n) = Sum_{k=1..n} ((n-1)!/(n-k)!)*b(k)*a(n-k), n >= 1 and a(0) = 1, with b(n) = A001818(n) = ((2*n-1)!!)^2.
a(n) = n!*P(n), with P(n) = (1/n)*(Sum_{k=0..n-1} b(n-k)*P(k)), n >= 1 and P(0) = 1, with b(n) = A001818(n) = ((2*n-1)!!)^2.
E.g.f.: exp(Sum_{n >= 1} b(n)*x^n/n) with b(n) = A001818(n) = ((2*n-1)!!)^2.
denom(a(n)/2^n) = A001316(n); numer(a(n)/2^n) = [1, 1, 5, 239, 8531, 2726207, ...].

A288950 Number of relaxed compacted binary trees of right height at most one with empty initial and final sequence on level 0.

Original entry on oeis.org

1, 0, 1, 2, 15, 140, 1575, 20790, 315315, 5405400, 103378275, 2182430250, 50414138775, 1264936572900, 34258698849375, 996137551158750, 30951416768146875, 1023460181133390000, 35885072600989486875, 1329858572860198631250, 51938365373373313209375

Offset: 0

Michael Wallner, Jun 20 2017

nonn

A relaxed compacted binary tree of size n is a directed acyclic graph consisting of a binary tree with n internal nodes, one leaf, and n pointers. It is constructed from a binary tree of size n, where the first leaf in a post-order traversal is kept and all other leaves are replaced by pointers. These links may point to any node that has already been visited by the post-order traversal. The right height is the maximal number of right-edges (or right children) on all paths from the root to any leaf after deleting all pointers. The number of unbounded relaxed compacted binary trees of size n is A082161(n). The number of relaxed compacted binary trees of right height at most one of size n is A001147(n). See the Genitrini et al. and Wallner link. - Michael Wallner, Apr 20 2017

a(n) is the number of plane increasing trees with n+1 nodes where node 3 is at depth 1 on the right of node 2 and where the node n+1 has a left sibling. See the Wallner link. - Michael Wallner, Apr 20 2017

			Denote by L the leaf and by o nodes. Every node has exactly two out-going edges or pointers. Internal edges are denoted by - or |. Pointers are omitted and may point to any node further right. The root is at level 0 at the very left.
The general structure is
  L-o-o-o-o-o-o-o-o-o
    |       |     | |
    o   o-o-o   o-o o.
For n=0 the a(0)=1 solution is L.
For n=1 we have a(1)=0 because we need nodes on level 0 and level 1.
For n=2 the a(2)=1 solution is
     L-o
       |
       o
and the pointers of the node on level 1 both point to the leaf.
For n=3 the a(3)=2 solutions have the structure
     L-o
       |
     o-o
where the pointers of the last node have to point to the leaf, but the pointer of the next node has 2 choices: the leaf of the previous node.

Antoine Genitrini, Bernhard Gittenberger, Manuel Kauers and Michael Wallner, Asymptotic Enumeration of Compacted Binary Trees, arXiv:1703.10031 [math.CO], 2017.
Michael Wallner, A bijection of plane increasing trees with relaxed binary trees of right height at most one, arXiv:1706.07163 [math.CO], 2017.

Cf. A001147 (relaxed compacted binary trees of right height at most one).
Cf. A082161 (relaxed compacted binary trees of unbounded right height).
Cf. A000032, A000246, A001879, A051577, A177145, A213527, A288950, A288952, A288953, A288954 (subclasses of relaxed compacted binary trees of right height at most one, see the Wallner link).
Cf. A000166, A000255, A000262, A052852, A123023, A130905, A176408, A201203 (variants of relaxed compacted binary trees of right height at most one, see the Wallner link).
Cf. A001879.

terms = 21; (z + (1 - z)/3*(2 - z + (1 - 2z)^(-1/2)) + O[z]^terms // CoefficientList[#, z] &) Range[0, terms-1]! (* Jean-François Alcover, Dec 04 2018 *)

E.g.f.: z + (1-z)/3 * (2-z + (1-2*z)^(-1/2)).
From Seiichi Manyama, Apr 26 2025: (Start)
a(n) = (n-1)*(2*n-3)/(n-2) * a(n-1) for n > 3.
a(n) = A001879(n-2)/3 for n > 2. (End)

A121408 Triangle T(n,k) defined by the generating function: exp(yarcsin(x))-1 = Sum_{n>=1} (Sum_{k=1..n} T(n,k)y^k)*x^n/n!.

Original entry on oeis.org

1, 0, 1, 1, 0, 1, 0, 4, 0, 1, 9, 0, 10, 0, 1, 0, 64, 0, 20, 0, 1, 225, 0, 259, 0, 35, 0, 1, 0, 2304, 0, 784, 0, 56, 0, 1, 11025, 0, 12916, 0, 1974, 0, 84, 0, 1, 0, 147456, 0, 52480, 0, 4368, 0, 120, 0, 1, 893025, 0, 1057221, 0, 172810, 0, 8778, 0, 165, 0, 1, 0, 14745600, 0

Offset: 1

Emeric Deutsch, Jul 28 2006

Row sums are equal to A006228(n). This is sequence A091885 with additional intertwining zeros.
F(n,m) = n!*T(n,m)/m! is a composite (akin to Riordan arrays) of F(x)=arcsin(x) and (F(x))^m = Sum_{n>=m} F(n,m)*x^n, and for o.g.f. G(x), G(arcsin(x)) = g(0) +Sum_{n>=1} Sum_{m=1..n} F(n,m)*g(m)*x^n, see the preprint. - Vladimir Kruchinin, Feb 10 2011
The unsigned matrix inverse is A136630 (with a different offset). - Peter Bala, Feb 23 2011
Also the Bell transform of A177145. For the definition of the Bell transform see A264428. - Peter Luschny, Jan 27 2016

			Triangle starts:
  1;
  0,1;
  1,0,1;
  0,4,0,1;
  9,0,10,0,1;
  0,64,0,20,0,1;
Row polynomials R(6,x) = x^2*(x^2 + 2^2)*(x^2 + 4^2) = 64*x^2 + 20*x^4 + x^6 and
R(7,x) = x*(x^2 + 1)*(x^2 + 3^2)*(x^2 + 5^2) = 225*x + 259*x^3 + 35*x^5 + x^7. - _Peter Bala_, Aug 29 2012

B. C. Berndt, Ramanujan's Notebooks Part 1, Springer-Verlag 1985.

Vladimir Kruchinin, Composition of ordinary generating functions, arXiv:1009.2565 [math.CO], 2010.

Cf. A000111, A000142, A006228, A091885, A136630. A182971.

g:=exp(y*arcsin(x))-1: gser:=simplify(series(g,x=0,15)): for n from 1 to 12 do P[n]:=sort(n!*coeff(gser,x,n)) od: for n from 1 to 12 do seq(coeff(P[n],y,k),k=1..n) od; # yields sequence in triangular form
# The function BellMatrix is defined in A264428.
# Adds (1,0,0,0, ..) as column 0.
BellMatrix(n -> `if`(n::odd,0,doublefactorial(n-1)^2), 9); # Peter Luschny, Jan 27 2016

BellMatrix[f_Function, len_] := With[{t = Array[f, len, 0]}, Table[BellY[n, k, t], {n, 0, len - 1}, {k, 0, len - 1}]];
rows = 12;
M = BellMatrix[If[OddQ[#], 0, (# - 1)!!^2] &, rows];
Table[M[[n, k]], {n, 2, rows}, {k, 2, n}] // Flatten (* Jean-François Alcover, Jun 24 2018, after Peter Luschny *)

T(n,m) = ((n-1)!/(m-1)!) *sum_{k=1..n-m} sum_{j=1..k} binomial(k,j) *(2^(1-j) /(n-m+j)!) *sum{i=0..floor(j/2)} (-1)^((n-m)/2-i-j) *binomial(j,i) *(j-2*i)^(n-m+j) *binomial(k+n-1,n-1), n>m and even(n-m). [Vladimir Kruchinin, Feb 10 2011]
From Peter Bala, Aug 29 2012: (Start)
See A182971 for a version of the row reverse of this triangle.
Even-indexed row polynomial R(2*n,x) = x^2*prod(k=1..n-1, (x^2 + (2*k)^2) ).
Odd-indexed row polynomial R(2*n+1,x) = x*prod(k=1..n, (x^2 + (2*k-1)^2) ). See Berndt p.263. (End)
Sum_{k=0..n} T(n+1,k+1)*A000111(k) = n! = A000142(n). - Alexander Burstein, Aug 01 2025

A288952 Number of relaxed compacted binary trees of right height at most one with empty sequences between branch nodes on level 0.

Original entry on oeis.org

1, 0, 1, 2, 15, 92, 835, 8322, 99169, 1325960, 19966329, 332259290, 6070777999, 120694673748, 2594992240555, 59986047422378, 1483663965460545, 39095051587497488, 1093394763005554801, 32347902448449172530, 1009325655965539561231, 33125674098690460236620

Offset: 0

Michael Wallner, Jun 20 2017

nonn

A relaxed compacted binary tree of size n is a directed acyclic graph consisting of a binary tree with n internal nodes, one leaf, and n pointers. It is constructed from a binary tree of size n, where the first leaf in a post-order traversal is kept and all other leaves are replaced by pointers. These links may point to any node that has already been visited by the post-order traversal. The right height is the maximal number of right-edges (or right children) on all paths from the root to any leaf after deleting all pointers. A branch node is a node with a left and right edge (no pointer). See the Genitrini et al. link. - Michael Wallner, Apr 20 2017

a(n) is the number of plane increasing trees with n+1 nodes where in the growth process induced by the labels a maximal young leaf has to be followed by a non-maximal young leaf. A young leaf is a leaf with no left sibling. A maximal young leaf is a young leaf with maximal label. See the Wallner link. - Michael Wallner, Apr 20 2017

			See A288950 and A288953.

Muniru A Asiru, Table of n, a(n) for n = 0..100
Antoine Genitrini, Bernhard Gittenberger, Manuel Kauers and Michael Wallner, Asymptotic Enumeration of Compacted Binary Trees, arXiv:1703.10031 [math.CO], 2017.
Michael Wallner, A bijection of plane increasing trees with relaxed binary trees of right height at most one, arXiv:1706.07163 [math.CO], 2017.

Cf. A001147 (relaxed compacted binary trees of right height at most one).
Cf. A082161 (relaxed compacted binary trees of unbounded right height).
Cf. A000032, A000246, A001879, A051577, A177145, A213527, A288950, A288953, A288954 (subclasses of relaxed compacted binary trees of right height at most one, see the Wallner link).
Cf. A000166, A000255, A000262, A052852, A123023, A130905, A176408, A201203 (variants of relaxed compacted binary trees of right height at most one, see the Wallner link).

a := [1,0];; for n in [3..10^2] do a[n] := (n-2)*a[n-1] + (n-2)^2*a[n-2]; od; a; # Muniru A Asiru, Jan 26 2018

a:=proc(n) option remember: if n=0 then 1 elif n=1 then 0 elif n>=2 then (n-1)*procname(n-1)-(n-1)^2*procname(n-2) fi; end:
seq(a(n),n=0..100); # Muniru A Asiru, Jan 26 2018

Fold[Append[#1, (#2 - 1) Last[#1] + #1[[#2 - 1]] (#2 - 1)^2] &, {1, 0}, Range[2, 21]] (* Michael De Vlieger, Jan 28 2018 *)

E.g.f.: exp( -Sum_{n>=1} Fibonacci(n-1)*x^n/n ), where Fibonacci(n) = A000045(n).
E.g.f.: exp( -1/sqrt(5)*arctanh(sqrt(5)*z/(2-z)) )/sqrt(1-z-z^2).
a(0) = 1, a(1) = 0, a(n) = (n-1)*a(n-1) + (n-1)^2*a(n-2). - Daniel Suteu, Jan 25 2018

A288953 Number of relaxed compacted binary trees of right height at most one with minimal sequences between branch nodes except after the last branch node on level 0.

Original entry on oeis.org

1, 1, 3, 10, 51, 280, 1995, 15120, 138075, 1330560, 14812875, 172972800, 2271359475, 31135104000, 471038042475, 7410154752000, 126906349444875, 2252687044608000, 43078308695296875, 851515702861824000, 17984171447178811875, 391697223316439040000

Offset: 0

Michael Wallner, Jun 20 2017

nonn

A relaxed compacted binary tree of size n is a directed acyclic graph consisting of a binary tree with n internal nodes, one leaf, and n pointers. It is constructed from a binary tree of size n, where the first leaf in a post-order traversal is kept and all other leaves are replaced by pointers. These links may point to any node that has already been visited by the post-order traversal. The right height is the maximal number of right-edges (or right children) on all paths from the root to any leaf after deleting all pointers. A branch node is a node with a left and right edge (no pointer). See the Genitrini et al. link. - Michael Wallner, Apr 20 2017

a(n) is the number of plane increasing trees with n+1 nodes where in the growth process induced by the labels maximal young leaves and non-maximal young leaves alternate except for a sequence of maximal young leaves at the beginning. A young leaf is a leaf with no left sibling. A maximal young leaf is a young leaf with maximal label. See the Wallner link. - Michael Wallner, Apr 20 2017

			Denote by L the leaf and by o nodes. Every node has exactly two out-going edges or pointers. Internal edges are denoted by - or |. Pointers are omitted and may point to any node further right. The root is at level 0 at the very left.
The general structure is
  L-o-o-o-o-o-o-o-o
          | | | | |
          o o o o o.
For n=0 the a(0)=1 solution is L.
For n=1 the a(1)=1 solution is L-o.
For n=2 the a(2)=3 solutions are
L-o-o     L-o
            |
            o
  2    +   1    solutions of this shape with pointers.

Antoine Genitrini, Bernhard Gittenberger, Manuel Kauers and Michael Wallner, Asymptotic Enumeration of Compacted Binary Trees, arXiv:1703.10031 [math.CO], 2017
Michael Wallner, A bijection of plane increasing trees with relaxed binary trees of right height at most one, arXiv:1706.07163 [math.CO], 2017

Cf. A288954 (variation with additional initial sequence).
Cf. A177145 (variation without final sequence).
Cf. A001147 (relaxed compacted binary trees of right height at most one).
Cf. A082161 (relaxed compacted binary trees of unbounded right height).
Cf. A000032, A000246, A001879, A051577, A213527, A288950, A288952, A288954 (subclasses of relaxed compacted binary trees of right height at most one, see the Wallner link).
Cf. A000166, A000255, A000262, A052852, A123023, A130905, A176408, A201203 (variants of relaxed compacted binary trees of right height at most one, see the Wallner link).

E.g.f.: (2-z)/(3*(1-z)^2) + 1/(3*sqrt(1-z^2)).

A320958 The exponential limit of arcsin (odd indices only).

Original entry on oeis.org

1, 5, 468, 197325, 233145675, 605979974250, 2987147975582925, 25254853526009732625, 340477692051264295027500, 6926101229658271208893970625, 203562520854789108487169894574375, 8346651541805126492397454664310896250, 463877742240727904202821053051014479795625

Offset: 0

Peter Luschny, Nov 08 2018

nonn

See A320956 for definitions and comments.

			Illustration of the convergence in the sense of A320956:
   [0] 0, 0, 0, 0, 0,   0, 0,      0, 0,         0, ...
   [1] 0, 1, 0, 1, 0,   9, 0,    225, 0,     11025, ... A177145, A001818
   [2] 0, 1, 0, 4, 0, 144, 0,  14400, 0,   2822400, ... A122747
   [3] 0, 1, 0, 5, 0, 369, 0,  82125, 0,  36173025, ...
   [4] 0, 1, 0, 5, 0, 459, 0, 160875, 0, 121837275, ...
   [5] 0, 1, 0, 5, 0, 468, 0, 192375, 0, 198472050, ...
   [6] 0, 1, 0, 5, 0, 468, 0, 197100, 0, 227644200, ...
   [7] 0, 1, 0, 5, 0, 468, 0, 197325, 0, 232737750, ...
   [8] 0, 1, 0, 5, 0, 468, 0, 197325, 0, 233134650, ...
   [9] 0, 1, 0, 5, 0, 468, 0, 197325, 0, 233145675, ...

Cf. A320955 (exp), A320962 (log(x+1)), A320956 (sec+tan), this sequence (arcsin),
A320959 (arctanh).
Cf. A177145, A001818, A122747.

# Function ExpLim defined in A320956.
L := [ExpLim(28, arcsin)]: seq(L[2*n], n=1..13);

m = 13; CoefficientList[ArcSin[x] + O[x]^(2 m + 1), x]*Range[0, 2 m - 1]!*BellB[Range[0, 2 m - 1]] // DeleteCases[#, 0]& (* Jean-François Alcover, Jul 23 2019 *)

A288954 Number of relaxed compacted binary trees of right height at most one with minimal sequences between branch nodes except before the first and after the last branch node on level 0.

Original entry on oeis.org

1, 1, 3, 13, 79, 555, 4605, 42315, 436275, 4894155, 60125625, 794437875, 11325612375, 172141044075, 2793834368325, 48009995908875, 874143494098875, 16757439016192875, 338309837281040625, 7157757510792763875, 158706419654857449375, 3673441093896736036875

Offset: 2

Michael Wallner, Jun 20 2017

nonn

A relaxed compacted binary tree of size n is a directed acyclic graph consisting of a binary tree with n internal nodes, one leaf, and n pointers. It is constructed from a binary tree of size n, where the first leaf in a post-order traversal is kept and all other leaves are replaced by pointers. These links may point to any node that has already been visited by the post-order traversal. The right height is the maximal number of right-edges (or right children) on all paths from the root to any leaf after deleting all pointers. A branch node is a node with a left and right edge (no pointer). See the Genitrini et al. link. - Michael Wallner, Apr 20 2017

a(n) is the number of plane increasing trees with n+1 nodes where in the growth process induced by the labels a maximal young leaves and non-maximal young leaves alternate except for a sequence of maximal young leaves at the begininning and at the end. A young leaf is a leaf with no left sibling. A maximal young leaf is a young leaf with maximal label. See the Wallner link. - Michael Wallner, Apr 20 2017

			See A288950 and A288953.

Antoine Genitrini, Bernhard Gittenberger, Manuel Kauers and Michael Wallner, Asymptotic Enumeration of Compacted Binary Trees, arXiv:1703.10031 [math.CO], 2017.
Michael Wallner, A bijection of plane increasing trees with relaxed binary trees of right height at most one, arXiv:1706.07163 [math.CO], 2017.

Cf. A288953 (variation without initial sequence).
Cf. A177145 (variation without initial and final sequence).
Cf. A001147 (relaxed compacted binary trees of right height at most one).
Cf. A082161 (relaxed compacted binary trees of unbounded right height).
Cf. A000032, A000246, A001879, A051577, A213527, A288950, A288952 (subclasses of relaxed compacted binary trees of right height at most one, see the Wallner link).
Cf. A000166, A000255, A000262, A052852, A123023, A130905, A176408, A201203 (variants of relaxed compacted binary trees of right height at most one, see the Wallner link).

terms = 22; egf = 1/(3(1-z))(1/Sqrt[1-z^2] + (3z^3 - z^2 - 2z + 2)/((1-z)(1-z^2))) + O[z]^terms;
CoefficientList[egf, z] Range[0, terms-1]! (* Jean-François Alcover, Dec 13 2018 *)

E.g.f.: 1/(3*(1-z))*( 1/sqrt(1-z^2) + (3*z^3-z^2-2*z+2)/((1-z)*(1-z^2)) ).

A123516 Triangle read by rows: T(n,k) = (-1)^k * n! * 2^(n-2k) binomial(n,k) * binomial(2*k,k) (0<=k<=n).

Original entry on oeis.org

1, 2, -1, 8, -8, 3, 48, -72, 54, -15, 384, -768, 864, -480, 105, 3840, -9600, 14400, -12000, 5250, -945, 46080, -138240, 259200, -288000, 189000, -68040, 10395, 645120, -2257920, 5080320, -7056000, 6174000, -3333960, 1018710, -135135, 10321920, -41287680, 108380160, -180633600, 197568000

Offset: 0

Emeric Deutsch, Oct 14 2006

Row sums yield the double factorial numbers (A001147).

			Triangle begins:
  1;
  2,     -1;
  8,     -8,      3;
  48,    -72,     54,     -15;
  384,   -768,    864,    -480,    105;
  3840,  -9600,   14400,  -12000,  5250,   -945;
  46080, -138240, 259200, -288000, 189000, -68040, 10395;
  ...

G. C. Greubel, Table of n, a(n) for the first 50 rows, flattened
B. T. Gill, Problem 1729Math. Magazine, vol. 79, No. 4, 2006, p. 313, problem 1729.

Cf. A001147, A000165, A177145, A331817.

/* As triangle */ [[(-1)^k*Factorial(n)*2^(n-2*k)* Binomial(n,k)*Binomial(2*k,k): k in [0..n]]: n in [0.. 15]]; // Vincenzo Librandi, Oct 15 2017

T:=(n,k)->(-1)^k*n!*2^(n-2*k)*binomial(n,k)*binomial(2*k,k): for n from 0 to 8 do seq(T(n,k),k=0..n) od; # yields sequence in triangular form

Table[(-1)^k*n! 2^(n - 2 k)*Binomial[n, k]*Binomial[2*k, k], {n, 0, 10}, {k, 0, n}] // Flatten (* G. C. Greubel, Oct 14 2017 *)

for(n=0,10, for(k=0,n, print1((-1)^k*n!*2^(n-2*k)*binomial(n,k)* binomial(2*k,k), ", "))) \\ G. C. Greubel, Oct 14 2017

T(n,0) = 2^n * n! = A000165(n).
T(n,n) = (-1)^n*A001147(n).
From Peter Bala, Aug 09 2024: (Start)
The polynomial P(n, x) = Sum_{k = 0..n} T(n, k)*x^(n-k) satisfies the functional equation P(n, 1 - x) = (-1)^n*P(n, x).
P(n, x) = (2*n - 1)*(2*x - 1)*P(n-1, x) + 4*(n - 1)^2*x*(1 - x)*P(n-2, x) with P(0, x) = 1 and P(1, x) = 2*x - 1.
P(n, 1/2) = A177145(n+1); P(n, -1/2) = (-1)^n*A331817(n).
Conjecture 1: for n >= 1, the zeros of P(n, x) lie on the vertical line Re(x) = 1/2 in the complex plane; that is, the family of polynomials {P(n, x) : n >= 1} satisfies a Riemann hypothesis.
Set u = x^2 and define p(n, u) = P(n, 1/2 + x) if n is even, else p(n, x) = (1/x)* P(n, 1/2 + x). The first few polynomials are p(0, u) = 1, p(1, u) = 2, p(2, u) = 8*u + 1, p(3, u) = 48*u + 18 and p(4, u) = 384*u^2 + 288*u + 9.
Conjecture 2: for n >= 2, the zeros of p(n+1, u) are negative and interlace the zeros of p(n, u). (End)

A298854 Characteristic polynomials of Jacobi coordinates. Triangle read by rows, T(n, k) for 0 <= k <= n.

Original entry on oeis.org

1, 1, 1, 2, 3, 2, 6, 11, 11, 6, 24, 50, 61, 50, 24, 120, 274, 379, 379, 274, 120, 720, 1764, 2668, 3023, 2668, 1764, 720, 5040, 13068, 21160, 26193, 26193, 21160, 13068, 5040, 40320, 109584, 187388, 248092, 270961, 248092, 187388, 109584, 40320, 362880, 1026576, 1836396, 2565080, 2995125, 2995125, 2565080, 1836396, 1026576, 362880

Offset: 0

F. Chapoton, Jan 27 2018

This is just a different normalization of A223256 and A223257.

			For n = 3, the polynomial is 6*x^3 + 11*x^2 + 11*x + 6.
The first few polynomials, as a table:
[  1],
[  1,   1],
[  2,   3,   2],
[  6,  11,  11,   6],
[ 24,  50,  61,  50,  24],
[120, 274, 379, 379, 274, 120]

Closely related to A223256 and A223257.
Row sums are A002720.
Leftmost and rightmost columns are A000142.
Alternating row sums are A177145.
Absolute value of evaluation at x = exp(2*i*Pi/3) is A080171.
Evaluation at x=2 gives A187735.

b:= proc(n) option remember; `if`(n<1, n+1, expand(
      n*(x+1)*b(n-1)-(n-1)^2*x*b(n-2)))
    end:
T:= n-> (p-> seq(coeff(p, x, i), i=0..n))(b(n)):
seq(T(n), n=0..10);  # Alois P. Heinz, Apr 01 2021

P[0] = 1 ; P[1] = x + 1;
P[n_] := P[n] = n (x + 1) P[n - 1] - (n - 1)^2 x P[n - 2];
Table[CoefficientList[P[n], x], {n, 0, 9}] // Flatten (* Jean-François Alcover, Mar 16 2020 *)

@cached_function
def poly(n):
    x = polygen(ZZ, 'x')
    if n < 0:
        return x.parent().zero()
    elif n == 0:
        return x.parent().one()
    else:
        return n * (x + 1) * poly(n - 1) - (n - 1)**2 * x * poly(n - 2)
A298854_row = lambda n: list(poly(n))
for n in (0..7): print(A298854_row(n))

P(0)=1 and P(n) = n * (x + 1) * P(n - 1) - (n - 1)^2 * x * P(n - 2).

cp's OEIS Frontend

A005359 a(n) = n! if n is even, otherwise 0 (from Taylor series for cos x).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A274760 The multinomial transform of A001818(n) = ((2*n-1)!!)^2.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A288950 Number of relaxed compacted binary trees of right height at most one with empty initial and final sequence on level 0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A121408 Triangle T(n,k) defined by the generating function: exp(y*arcsin(x))-1 = Sum_{n>=1} (Sum_{k=1..n} T(n,k)*y^k)*x^n/n!.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A288952 Number of relaxed compacted binary trees of right height at most one with empty sequences between branch nodes on level 0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

GAP

Maple

Mathematica

Formula

A288953 Number of relaxed compacted binary trees of right height at most one with minimal sequences between branch nodes except after the last branch node on level 0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A320958 The exponential limit of arcsin (odd indices only).

Views

Author

Keywords

Comments

Examples

Crossrefs

A121408 Triangle T(n,k) defined by the generating function: exp(yarcsin(x))-1 = Sum_{n>=1} (Sum_{k=1..n} T(n,k)y^k)*x^n/n!.

A123516 Triangle read by rows: T(n,k) = (-1)^k * n! * 2^(n-2k) binomial(n,k) * binomial(2*k,k) (0<=k<=n).