A052852 -id:A052852 - cp's OEIS frontend

A206703 Triangular array read by rows. T(n,k) is the number of partial permutations (injective partial functions) of {1,2,...,n} that have exactly k elements in a cycle. The k elements are not necessarily in the same cycle. A fixed point is considered to be in a cycle.

1, 1, 1, 3, 2, 2, 13, 9, 6, 6, 73, 52, 36, 24, 24, 501, 365, 260, 180, 120, 120, 4051, 3006, 2190, 1560, 1080, 720, 720, 37633, 28357, 21042, 15330, 10920, 7560, 5040, 5040, 394353, 301064, 226856, 168336, 122640, 87360, 60480, 40320, 40320

Offset: 0

Geoffrey Critzer, Feb 11 2012

			     1;
     1,     1;
     3,     2,     2;
    13,     9,     6,     6;
    73,    52,    36,    24,    24;
   501,   365,   260,   180,   120,  120;
  4051,  3006,  2190,  1560,  1080,  720,   720;
  ...

Mohammad K. Azarian, On the Fixed Points of a Function and the Fixed Points of its Composite Functions, International Journal of Pure and Applied Mathematics, Vol. 46, No. 1, 2008, pp. 37-44. Mathematical Reviews, MR2433713 (2009c:65129), March 2009. Zentralblatt MATH, Zbl 1160.65015.
Mohammad K. Azarian, Fixed Points of a Quadratic Polynomial, Problem 841, College Mathematics Journal, Vol. 38, No. 1, January 2007, p. 60. Solution published in Vol. 39, No. 1, January 2008, pp. 66-67.

Alois P. Heinz, Rows n = 0..140, flattened
Philippe Flajolet and Robert Sedgewick, Analytic Combinatorics, Cambridge Univ. Press, 2009, page 132.

Columns k = 0..1 give: A000262, A006152.
Main diagonal gives A000142.
Row sums give A002720.
T(2n,n) gives A088026.
Cf. A002720, A052852, A103194, A105219, A331725.

b:= proc(n) option remember; `if`(n=0, 1, add((p-> p+x^j*
      coeff(p, x, 0))(b(n-j)*binomial(n-1, j-1)*j!), j=1..n))
    end:
T:= n-> (p-> seq(coeff(p, x, i), i=0..n))(b(n)):
seq(T(n), n=0..10);  # Alois P. Heinz, Feb 19 2022

nn = 7; a = 1/(1 - x); ay = 1/(1 - y x); f[list_] := Select[list, # > 0 &]; Map[f, Range[0, nn]! CoefficientList[Series[Exp[a x] ay, {x, 0, nn}], {x, y}]] // Flatten

E.g.f.: exp(x/(1-x))/(1-y*x).
From Alois P. Heinz, Feb 19 2022: (Start)
Sum_{k=1..n} T(n,k) = A052852.
Sum_{k=0..n} k * T(n,k) = A103194(n).
Sum_{k=0..n} (n-k) * T(n,k) =  A105219(n).
Sum_{k=0..n} (-1)^k * T(n,k) = A331725(n). (End)

A216294 Triangular array read by rows: T(n,k) is the number of partial permutations of {1,2,...,n} that have exactly k cycles, 0<=k<=n.

Original entry on oeis.org

1, 1, 1, 3, 3, 1, 13, 14, 6, 1, 73, 84, 41, 10, 1, 501, 609, 325, 95, 15, 1, 4051, 5155, 2944, 965, 190, 21, 1, 37633, 49790, 30023, 10689, 2415, 343, 28, 1, 394353, 539616, 340402, 129220, 32179, 5348, 574, 36, 1, 4596553, 6478521, 4246842, 1698374, 455511, 84567, 10794, 906, 45, 1

Offset: 0

Geoffrey Critzer, Sep 04 2012

A partial permutation on a set X is a bijection between two subsets of X.
Row sums are A002720.
First column (corresponding to k=0) is A000262.

			1;
1,     1;
3,     3,   1;
13,   14,   6,  1;
73,   84,  41, 10,  1;
501, 609, 325, 95, 15,  1;

Alois P. Heinz, Rows n = 0..50, flattened
Philippe Flajolet and Robert Sedgewick, Analytic Combinatorics, Cambridge Univ. Press, 2009, page 132.

Cf. A021009. A000262, A002720, A052852, A062147, A062192, A062266, A088699.

gf := exp(x / (1 - x)) / (1 - x)^y:
serx := series(gf, x, 10): poly := n -> simplify(coeff(serx, x, n)):
seq(print(seq(n!*coeff(poly(n), y, k), k = 0..n)), n = 0..9); # Peter Luschny, Feb 23 2023

nn=10;t=Sum[n^(n-1)x^n/n!,{n,1,nn}];f[list_]:=Select[list,#>0&];Map[f,Range[0,nn]!CoefficientList[Series[Exp[ x/(1-x)]/(1-x)^y,{x,0,nn}],{x,y}]]//Flatten

E.g.f.: exp(x/(1-x))/(1-x)^y.
From Peter Bala, Aug 23 2013: (Start)
Exponential Riordan array [exp(x/(1-x)), log(1/(1-x))].
The row polynomials R(n,y), n > = 0, satisfy the 2nd order recurrence equation R(n,y) = (2*n + y - 1)*R(n-1,y) - (n - 1)*(n + y - 2)*R(n-2,y) with R(0,y) = 1 and R(1,y) = 1 + y.
Modulo variations in offset we have: R(n,0) = A000262, R(n,1) = A002720, R(n,2) = A000262, R(n,3) = A052852, R(n,4) = A062147, R(n,5) = A062266 and R(n,6) = A062192. In general, for fixed k, the sequence {R(n,k)}n>=1 gives the entries on a diagonal of the square array A088699. (End)

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)

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

A293985 Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f. exp(x/(1-x))/(1-x)^k.

Original entry on oeis.org

1, 1, 1, 1, 2, 3, 1, 3, 7, 13, 1, 4, 13, 34, 73, 1, 5, 21, 73, 209, 501, 1, 6, 31, 136, 501, 1546, 4051, 1, 7, 43, 229, 1045, 4051, 13327, 37633, 1, 8, 57, 358, 1961, 9276, 37633, 130922, 394353, 1, 9, 73, 529, 3393, 19081, 93289, 394353, 1441729, 4596553

Offset: 0

Seiichi Manyama, Oct 21 2017

			Square array begins:
    1,    1,    1,    1,     1, ... A000012;
    1,    2,    3,    4,     5, ... A000027;
    3,    7,   13,   21,    31, ... A002061;
   13,   34,   73,  136,   229, ... A135859;
   73,  209,  501, 1045,  1961, ...
  501, 1546, 4051, 9276, 19081, ...
Antidiagonal rows begin as:
  1;
  1, 1;
  1, 2,  3;
  1, 3,  7, 13;
  1, 4, 13, 34,  73;
  1, 5, 21, 73, 209, 501; - _G. C. Greubel_, Mar 09 2021

Seiichi Manyama, Antidiagonals n = 0..139, flattened
Wikipedia, Laguerre polynomials
Index entries for sequences related to Laguerre polynomials

Columns k=0..6 give: A000262, A002720, A000262(n+1), A052852(n+1), A062147, A062266, A062192.
Main diagonal gives A152059.
Similar table: A086885, A088699, A176120.

function t(n,k)
  if n eq 0 then return 1;
  else return Factorial(n-1)*(&+[(j+k)*t(n-j,k)/Factorial(n-j): j in [1..n]]);
  end if; return t;
end function;
[t(k,n-k): k in [0..n], n in [0..12]]; // G. C. Greubel, Mar 09 2021

t[n_, k_]:= t[n, k]= If[n==0, 1, (n-1)!*Sum[(j+k)*t[n-j,k]/(n-j)!, {j,n}]];
T[n_,k_]:= t[k,n-k]; Table[T[n,k], {n,0,12}, {k,0,n}]//Flatten (* G. C. Greubel, Mar 09 2021 *)

@CachedFunction
def t(n,k): return 1 if n==0 else factorial(n-1)*sum( (j+k)*t(n-j,k)/factorial(n-j) for j in (1..n) )
def T(n,k): return t(k,n-k)
flatten([[T(n,k) for k in (0..n)] for n in (0..12)]) # G. C. Greubel, Mar 09 2021

A(0,k) = 1 and A(n,k) = (n-1)! * Sum_{j=1..n} (j+k)*A(n-j,k)/(n-j)! for n > 0.
A(0,k) = 1, A(1,k) = k+1 and A(n,k) = (2*n-1+k)*A(n-1,k) - (n-1)*(n-2+k)*A(n-2,k) for n > 1.
From Seiichi Manyama, Jan 25 2025: (Start)
A(n,k) = n! * Sum_{j=0..n} binomial(n+k-1,j)/(n-j)!.
A(n,k) = n! * LaguerreL(n, k-1, -1). (End)

A351767 Expansion of e.g.f. exp( x/(1-x)^3 ) / (1-x)^3.

Original entry on oeis.org

1, 4, 25, 214, 2293, 29176, 427189, 7049890, 129178249, 2597880268, 56815155121, 1341068392654, 33951269718205, 917020113259264, 26305693331946253, 798293630021120986, 25540244079135784849, 858854698277997113620, 30274382852181639467209

Offset: 0

Seiichi Manyama, Mar 18 2023

nonn

Winston de Greef, Table of n, a(n) for n = 0..420

Column k=3 of A361616.

Cf. A052852, A361599.

Table[n!*Sum[Binomial[n + 2*k + 2, n - k]/k!, {k, 0, n}], {n, 0, 20}] (* Vaclav Kotesovec, Mar 25 2023 *)

my(N=20, x='x+O('x^N)); Vec(serlaplace(exp(x/(1-x)^3)/(1-x)^3))

a(n) = n! * sum(k=0, n, binomial(n+2*k+2,n-k)/k!); \\ Winston de Greef, Mar 18 2023

a(n) = n! * Sum_{k=0..n} binomial(n+2*k+2,n-k)/k! = Sum_{k=0..n} (n+2*k+2)!/(3*k+2)! * binomial(n,k).
From Vaclav Kotesovec, Mar 25 2023: (Start)
a(n) = 4*n*a(n-1) - (n-1)*(6*n - 5)*a(n-2) + (n-2)*(n-1)*(4*n - 3)*a(n-3) - (n-3)*(n-2)*(n-1)^2*a(n-4).
a(n) ~ exp(-1/27 - 3^(-5/4)*n^(1/4)/8 + sqrt(n/3)/2 + 4*3^(-3/4)*n^(3/4) - n) * n^(n + 5/8) / (2 * 3^(5/8)) * (1 + 91837/69120 * 3^(1/4)/n^(1/4)). (End)

A059114 Triangle T(n,m)= Sum_{i=0..n} L'(n,i)*Product_{j=1..m} (i-j+1), read by rows.

Original entry on oeis.org

1, 1, 1, 3, 4, 2, 13, 21, 18, 6, 73, 136, 156, 96, 24, 501, 1045, 1460, 1260, 600, 120, 4051, 9276, 15030, 16320, 11160, 4320, 720, 37633, 93289, 170142, 219450, 192360, 108360, 35280, 5040, 394353, 1047376, 2107448, 3116736, 3294480, 2405760, 1149120, 322560, 40320

Offset: 0

Vladeta Jovovic, Jan 04 2001

L'(n,i) are unsigned Lah numbers (Cf. A008297): L'(n,i) = (n!/i!)*binomial(n-1,i-1) for i >= 1, L'(0,0) = 1, L'(n,0) = 0 for n > 0.

			Triangle begins as:
    1;
    1,    1;
    3,    4,    2;
   13,   21,   18,    6;
   73,  136,  156,   96,  24;
  501, 1045, 1460, 1260, 600, 120;
  ...;
E.g.f. for T(n, 2) = (x/(1-x))^2*e^(x/(x-1)) = x^2 + 3*x^3 + 13/2*x^4 + 73/6*x^5 + 167/8*x^6 + 4051/120*x^7 + ...

Cf. A000262, A052852, A052897, A059110.

Row sums give A059115. Alternating row sums give A288268.

[Factorial(n)*Evaluate(LaguerrePolynomial(n-k, k-1), -1): k in [0..n], n in [0..12]]; // G. C. Greubel, Feb 23 2021

Table[n!*LaguerreL[n-k, k-1, -1], {n,0,12}, {k,0,n}]//Flatten (* G. C. Greubel, Feb 23 2021 *)

T(n, k) = n! * pollaguerre(n-k, k-1, -1); \\ Michel Marcus, Feb 23 2021

flatten([[factorial(n)*gen_laguerre(n-k, k-1, -1) for k in (0..n)] for n in (0..12)]) # G. C. Greubel, Feb 23 2021

E.g.f. for T(n, k) = (x/(1-x))^k * exp(x/(x-1)).
T(n, k)= Sum_{i=0..n} L'(n,i) * ( Product_{j=1..k} (i-j+1) ).
T(n, 0) = A000262(n).
T(n, 1) = A052852(n).
From G. C. Greubel, Feb 23 2021: (Start)
T(n, k) = n! * k! * Sum_{j=0..n} binomial(j, k)*binomial(n-1, j-1)/j!.
T(n, k) = n! * Laguerre(n-k, k-1, -1).
T(n, k) = n!*binomial(n-1, k-1)*Hypergeometric1F1([k-n], [k], -1) with T(n, 0) = Hypergeometric2F0([1-n, -n], [], 1). (End)

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

A123525 Arises in the normal ordering of functions of a(a+)a, where a and a+ are the boson annihilation and creation operators, respectively.

Original entry on oeis.org

2, 14, 102, 836, 7730, 79962, 916454, 11533832, 158149026, 2346622310, 37458934502, 640013453004, 11652216012242, 225169809833906, 4602407562991590, 99194703240441872

Offset: 1

Karol A. Penson, Oct 02 2006

nonn

G. C. Greubel, Table of n, a(n) for n = 1..440

Cf.: A002720, A052852, A123510, A123511, A123512, A123526, A123527.

Rest[With[{nmax = 50}, CoefficientList[Series[(1/(1 - x)^2)*Exp[x/(1 - x)]*LaguerreL[1, 1/(x - 1)]*x, {x, 0, nmax}], x]*Range[0, nmax]!]] (* G. C. Greubel, Oct 14 2017 *)

E.g.f.: (1/(1-x)^2)*exp(x/(1-x))*LaguerreL(1,1/(x-1))*x.
From Vaclav Kotesovec, Nov 13 2017: (Start)
Recurrence: (n-2)*(n-1)*a(n) = 2*(n-2)*n^2*a(n-1) - (n-1)^3*n*a(n-2).
a(n) ~ exp(2*sqrt(n) - n - 1/2) * n^(n + 5/4) / sqrt(2) * (1 + 31/(48*sqrt(n))).
(End)

A129833 a(n) = Sum_{k = 0..n } binomial(n + 1, k + 1)binomial(n, k)k!.

Original entry on oeis.org

1, 3, 11, 52, 309, 2221, 18703, 180216, 1952457, 23466223, 309577971, 4444537868, 68948023741, 1148825560377, 20455144724407, 387479309532976, 7778881684953873, 164942847995071611, 3682885668837002587, 86359724102207331876, 2121535102985378053061, 54482075844410029721893, 1459677302947807284662751

Offset: 0

Roger L. Bagula, May 21 2007

Seiichi Manyama, Table of n, a(n) for n = 0..443
F. Hivert, J.-C. Novelli and J.-Y. Thibon, Commutative combinatorial Hopf algebras, arXiv:math/0605262 [math.CO], 2006.

Cf. A052852, A176120.

[(&+[Binomial(n,k)^2*((n+1)*Factorial(k)/(k+1)): k in [0..n]]): n in [0..30]]; // G. C. Greubel, Mar 10 2021

A129833 := proc(n)
    add(A176120(n,k),k=0..n) ;
end proc: # R. J. Mathar, Feb 28 2015

a[n_]:= Sum[Binomial[n+1, k+1]*Binomial[n, k]*k!, {k,0,n}]; Table[a[n], {n,0,30}]

a(n) = sum(k= 0, n, binomial(n+1, k+1)*binomial(n, k)*k!); \\ Michel Marcus, Mar 10 2021

[sum( binomial(n,k)^2*((n+1)*factorial(k)/(k+1)) for k in (0..n)) for n in (0..30)] # G. C. Greubel, Mar 10 2021

Conjecture: +(n+1)*a(n) -n*(2*n+5)*a(n-1) +(n-1)*(n^2+6*n+3)*a(n-2) -(n-2)*(3*n^2-2)*a(n-3) +(n-2)*(n-3)*(3*n-4)*a(n-4) -(n-4)*(n-3)^2*a(n-5) = 0. - R. J. Mathar, Feb 28 2015
Conjecture: (n+1)*(n^2-4*n+2)*a(n) -n*(2*n^3-5*n^2-6*n+3)*a(n-1) +n*(n-1)*(n^3-2*n^2-2*n-2)*a(n-2) -(n-2)*(n^2-2*n-1)*(n-1)^2*a(n-3) = 0. - R. J. Mathar, Feb 28 2015
a(n) ~ exp(2*sqrt(n) - n - 1/2) * n^(n + 1/4) / sqrt(2) * (1 + 79/(48*sqrt(n))). - Vaclav Kotesovec, Oct 12 2016
From G. C. Greubel, Mar 10 2021: (Start)
a(n) = Sum_{k=0..n} binomial(n,k)^2 * ((n+1)*k!/(k+1)).
a(n) = (n+1)*Hypergeometric3F1([-n, -n, 1], [2], 1). (End)

Edited by N. J. A. Sloane, Sep 30 2007

cp's OEIS Frontend

A206703 Triangular array read by rows. T(n,k) is the number of partial permutations (injective partial functions) of {1,2,...,n} that have exactly k elements in a cycle. The k elements are not necessarily in the same cycle. A fixed point is considered to be in a cycle.

Views

Author

Keywords

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A216294 Triangular array read by rows: T(n,k) is the number of partial permutations of {1,2,...,n} that have exactly k cycles, 0<=k<=n.

Views

Author

Keywords

Comments

Examples

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

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

A293985 Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f. exp(x/(1-x))/(1-x)^k.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Magma

Mathematica

Sage

Formula

A351767 Expansion of e.g.f. exp( x/(1-x)^3 ) / (1-x)^3.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A059114 Triangle T(n,m)= Sum_{i=0..n} L'(n,i)*Product_{j=1..m} (i-j+1), read by rows.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A123525 Arises in the normal ordering of functions of a(a+)a, where a and a+ are the boson annihilation and creation operators, respectively.

A129833 a(n) = Sum_{k = 0..n } binomial(n + 1, k + 1)binomial(n, k)k!.