A002793 -id:A002793 - cp's OEIS frontend

A002720 Number of partial permutations of an n-set; number of n X n binary matrices with at most one 1 in each row and column.

1, 2, 7, 34, 209, 1546, 13327, 130922, 1441729, 17572114, 234662231, 3405357682, 53334454417, 896324308634, 16083557845279, 306827170866106, 6199668952527617, 132240988644215842, 2968971263911288999, 69974827707903049154, 1727194482044146637521, 44552237162692939114282

Offset: 0

N. J. A. Sloane

a(n) is also the total number of increasing subsequences of all permutations of [1..n] (see Lifschitz and Pittel). - N. J. A. Sloane, May 06 2012
a(n) = A000142 + A001563 + A001809 + A001810 + A001811 + A001812 + ... these sequences respectively give the number of increasing subsequences of length i for i=0,1,2,... in all permutations of [1..n]. - Geoffrey Critzer, Jan 17 2013
a(n) is also the number of matchings in the complete bipartite graph K(n,n). - Sharon Sela (sharonsela(AT)hotmail.com), May 19 2002
a(n) is also the number of 12-avoiding signed permutations in B_n (see Simion ref).
a(n) is also the order of the symmetric inverse semigroup (monoid) I_n. - A. Umar, Sep 09 2008
EXP transform of A001048(n) = n! + (n-1)!. - Franklin T. Adams-Watters, Dec 28 2006
From Peter Luschny, Mar 27 2011: (Start)
Let B_{n}(x) = Sum_{j>=0} exp(j!/(j-n)!*x-1)/j!; then a(n) = 2! [x^2] Taylor(B_{n}(x)), where [x^2] denotes the coefficient of x^2 in the Taylor series for B_{n}(x).
a(n) is column 2 of the square array representation of A090210. (End)
a(n) is the Hosoya index of the complete bipartite graph K_{n,n}. - Eric W. Weisstein, Jul 09 2011
a(n) is also number of non-attacking placements of k rooks on an n X n board, summed over all k >= 0. - Vaclav Kotesovec, Aug 28 2012
Also the number of vertex covers and independent vertex sets in the n X n rook graph. - Eric W. Weisstein, Jan 04 2013
a(n) is the number of injective functions from subsets of [n] to [n] where [n]={1,2,...,n}. For a subset D of size k, there are n!/(n-k)! injective functions from D to [n]. Summing over all subsets, we obtain a(n) = Sum_{k=0..n} C(n,k)*n!/(n-k)! = Sum_{k=0..n} k!*C(n,k)^2. - Dennis P. Walsh, Nov 16 2015
Also the number of cliques in the n X n rook complement graph. - Eric W. Weisstein, Sep 14 2017
a(n)/n! is the expected value of the n-th term of Ulam's "history-dependent random sequence". See Kac (1989), Eq.(2). - N. J. A. Sloane, Nov 16 2019
a(2*n) is odd and a(2*n+1) is even for all n. More generally, for each positive integer k, a(n+k) == a(n) (mod k) for all n. It follows that for each positive integer k, the sequence obtained by reducing a(n) modulo k is periodic, with period dividing k. Various divisibility properties of the sequence follow from this: for example, a(7*n+2) == 0 (mod 7), a(11*n+4) == 0 (mod 11), a(17*n+3) == 0 (mod 17) and a(19*n+4) == 0 (mod 19). - Peter Bala, Nov 07 2022
Conjecture: a(n)*k is the sum of the largest parts in all integer partitions containing their own first differences with n + 1 parts and least part k. - John Tyler Rascoe, Feb 28 2024

			G.f. = 1 + 2*x + 7*x^2 + 34*x^3 + 209*x^4 + 1546*x^5 + 13327*x^6 + 130922*x^7 + ... - _Michael Somos_, Jul 31 2018

J. M. Howie, Fundamentals of semigroup theory. Oxford: Clarendon Press, (1995). [From A. Umar, Sep 09 2008]
J. Ser, Les Calculs Formels des Séries de Factorielles. Gauthier-Villars, Paris, 1933, p. 78.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
H. S. Wall, Analytic Theory of Continued Fractions, Chelsea 1973, p. 356.

Alois P. Heinz, Table of n, a(n) for n = 0..443 (first 101 terms from T. D. Noe)
Francesca Aicardi, Diego Arcis, and Jesús Juyumaya, Ramified inverse and planar monoids, arXiv:2210.17461 [math.RT], 2022.
A. I. Aptekarev, On linear forms containing the Euler constant, arXiv:0902.1768 [math.NT], 2009.
T. Banica, The algebraic structure of quantum partial isometries, arXiv:1411.0577 [math.OA], 2014-2015.
C. Banderier, M. Bousquet-Mélou, A. Denise, P. Flajolet, D. Gardy, and D. Gouyou-Beauchamps, Generating Functions for Generating Trees, Discrete Mathematics 246(1-3), March 2002, pp. 29-55.
Teo Banica, Algebraic invariants of truncated Fourier matrices, arXiv preprint arXiv:1401.5023 [math.QA], 2014.
D. Borwein, S. Rankin, and L. Renner, Enumeration of injective partial transformations, Discrete Math. (1989), 73: 291-296. [From A. Umar, Sep 09 2008]
D. Castellanos, A generalization of Binet's formula and some of its consequences, Fib. Quart., 27 (1989), 424-438.
Aria Chen, Tyler Cummins, Rishi De Francesco, Jate Greene, Tanya Khovanova, Alexander Meng, Tanish Parida, Anirudh Pulugurtha, Anand Swaroop, and Samuel Tsui, Card Tricks and Information, arXiv:2405.21007 [math.HO], 2024. See p. 14.
Fabio Deelan Cunden, Jakub Czartowski, Giovanni Gramegna, and A. de Oliveira Junior, Relative volume of comparable pairs under semigroup majorization, arXiv:2410.23196 [math-ph], 2024. See pp. 4, 15.
Dan Daly and Lara Pudwell, Pattern avoidance in rook monoids, Special Session on Patterns in Permutations and Words, Joint Mathematics Meetings, 2013. - From _N. J. A. Sloane_, Feb 03 2013
P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009; see page 598.
Olof Giselsson, The Universal C*-Algebra of the Quantum Matrix Ball and its Irreducible *-Representations, arXiv:1801.10608 [math.QA], 2018.
J. Godbout, Combinatorial Properties of the Mirabolic RSK Algorithm, Thesis presented to The Faculty of the Graduate College of The University of Vermont, May 2013.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 64.
Z. Janelidze, F. van Niekerk, and J. Viljoen, What is the maximal connected partial symmetry index of a connected graph of a given size?, arXiv:2502.00704 [math.CO], 2025. See p. 3.
Mark Kac, A history-dependent random sequence defined by Ulam, Advances in Applied Mathematics 10.3 (1989): 270-277.
Vaclav Kotesovec, Non-attacking chess pieces, 6ed, 2013, p. 219.
Vaclav Kotesovec, Too many errors around coefficient C1 in asymptotic of sequence A002720, Sep 28 2012. [The bug in program Mathematica was fixed in version 10.2.0.0 / July 2015. _Vaclav Kotesovec_, Jul 25 2015]
V. Lifschitz and P. Pittel, The number of increasing subsequences of the random permutation J. Combin. Theory Ser. A 31 (1981), no. 1, 1--20. MR0626437 (84e:05012)
Mathematica Stack Exchange, Wrong Limit with LaguerreL, May 22 2015
W. D. Munn, The characters of the symmetric inverse semigroup, Proc. Cambridge Philos. Soc. 53 (1957), 13-18. [From A. Umar, Sep 09 2008]
K. A. Penson, P. Blasiak, A. Horzela, G. H. E. Duchamp, and A. I. Solomon, Laguerre-type derivatives: Dobinski relations and combinatorial identities, J. Math. Phys. vol. 50, 083512 (2009).
Alexsandar Petojevic, The Function vM_m(s; a; z) and Some Well-Known Sequences, Journal of Integer Sequences, Vol. 5 (2002), Article 02.1.7.
John Riordan, Letter, Apr 28 1976.
John Riordan, Letter to N. J. A. Sloane, Oct 01 1978.
John Riordan, Letter to N. J. A. Sloane, Sep 26 1980 with notes on the 1973 Handbook of Integer Sequences. Note that the sequences are identified by their N-numbers, not their A-numbers.
J. Ser, Les Calculs Formels des Séries de Factorielles, Gauthier-Villars, Paris, 1933 [Local copy].
J. Ser, Les Calculs Formels des Séries de Factorielles. (Annotated scans of some selected pages)
R. Simion, Combinatorial statistics on type-B analogues of non-crossing partitions and restricted permutations, Electronic J. of Comb. 7 (2000), Art #R9.
A. Umar, Some combinatorial problems in the theory of symmetric ..., Algebra Disc. Math. 9 (2010) 115-126.
Luis Verde-Star, A Matrix Approach to Generalized Delannoy and Schröder Arrays, J. Int. Seq., Vol. 24 (2021), Article 21.4.1.
D. P. Walsh, Notes on functions from subsets of {1,2,...,n} into {1,2,...,n}.
Eric Weisstein's World of Mathematics, Clique.
Eric Weisstein's World of Mathematics, Complete Bipartite Graph.
Eric Weisstein's World of Mathematics, Independent Vertex Set.
Eric Weisstein's World of Mathematics, Matching.
Eric Weisstein's World of Mathematics, Rook Complement Graph.
Eric Weisstein's World of Mathematics, Rook Graph.
Eric Weisstein's World of Mathematics, Vertex Cover.
Index entries for sequences related to Laguerre polynomials

Main diagonal of A088699. Column of A283500. Row sums of A144084.
Cf. A000110, A020556, A069223, A000712, A001048, A090210, A002793, A073003, A000262.
Column k=1 of A289192.
Cf. A160617, A160618.
Cf. A364673.

[Factorial(n)*Evaluate(LaguerrePolynomial(n), -1): n in [0..25]]; // G. C. Greubel, Aug 11 2022

A002720 := proc(n) exp(-x)*n!*hypergeom([n+1], [1], x); simplify(subs(x=1, %)) end: seq(A002720(n), n=0..25); # Peter Luschny, Mar 30 2011
A002720 := proc(n)
    option remember;
    if n <= 1 then
        n+1 ;
    else
        2*n*procname(n-1)-(n-1)^2*procname(n-2) ;
    end if;
end proc: # R. J. Mathar, Mar 09 2017

Table[n! LaguerreL[n, -1], {n, 0, 25}]
Table[(-1)^n*HypergeometricU[-n, 1, -1], {n, 0, 25}] (* Jean-François Alcover, Jul 15 2015 *)
RecurrenceTable[{(n+1)^2 a[n] - 2(n+2) a[n+1] + a[n+2]==0, a[1]==2, a[2]==7}, a, {n, 25}] (* Eric W. Weisstein, Sep 27 2017 *)

a(n) = sum(k=0, n, k!*binomial(n, k)^2 );

a(n) = suminf ( k=0, binomial(n+k,n)/k! ) / ( exp(1)/n! ) /* Gottfried Helms, Nov 25 2006 */

{a(n)=n!^2*polcoeff(exp(x+x*O(x^n))*sum(m=0,n,x^m/m!^2),n)} /* Paul D. Hanna, Nov 18 2011 */

{a(n)=if(n==0,1,polcoeff(1-sum(m=0, n-1, a(m)*x^m*(1-(m+1)*x+x*O(x^n))^2), n))} /* Paul D. Hanna, Nov 27 2012 */

my(x='x+O('x^22)); Vec(serlaplace((1/(1-x))*exp(x/(1-x)))) \\ Joerg Arndt, Aug 11 2022

from math import factorial, comb
def A002720(n): return sum(factorial(k)*comb(n,k)**2 for k in range(n+1)) # Chai Wah Wu, Aug 31 2023

[factorial(n)*laguerre(n, -1) for n in (0..25)] # G. C. Greubel, Aug 11 2022

a(n) = Sum_{k=0..n} k!*C(n, k)^2.
E.g.f.: (1/(1-x))*exp(x/(1-x)). - Don Knuth, Jul 1995
D-finite with recurrence: a(n) = 2*n*a(n-1) - (n-1)^2*a(n-2).
a(n) = Sum_{k>=0} (k+n)! / ((k!)^2*exp(1)). - Robert G. Wilson v, May 02 2002 [corrected by Vaclav Kotesovec, Aug 28 2012]
a(n) = Sum_{m>=0} (-1)^m*A021009(n, m). - Philippe Deléham, Mar 10 2004
a(n) = Sum_{k=0..n} C(n, k)n!/k!. - Paul Barry, May 07 2004
a(n) = Sum_{k=0..n} P(n, k)*C(n, k); a(n) = Sum_{k=0..n} n!^2/(k!*(n-k)!^2). - Ross La Haye, Sep 20 2004
a(n) = Sum_{k=0..n} (-1)^(n-k)*Stirling1(n, k)*Bell(k+1). - Vladeta Jovovic, Mar 18 2005
Define b(n) by b(0) = 1, b(n) = b(n-1) + (1/n) * Sum_{k=0..n-1} b(k). Then b(n) = a(n)/n!. - Franklin T. Adams-Watters, Sep 05 2005
Asymptotically, a(n)/n! ~ (1/2)*Pi^(-1/2)*exp(-1/2 + 2*n^(1/2))/n^(1/4) and so a(n) ~ C*BesselI(0, 2*sqrt(n))*n! with C = exp(-1/2) = 0.6065306597126334236... - Alec Mihailovs, Sep 06 2005, establishing a conjecture of Franklin T. Adams-Watters
a(n) = (n!/e) * Sum_{k>=0} binomial(n+k,n)/k!. - Gottfried Helms, Nov 25 2006
Integral representation as n-th moment of a positive function on a positive halfaxis (solution of the Stieltjes moment problem): a(n) = Integral_{x=0..oo} x^n*BesselI(0,2*sqrt(x))*exp(-x)/exp(1) dx, n >= 0. - Karol A. Penson and G. H. E. Duchamp (gduchamp2(AT)free.fr), Jan 09 2007
a(n) = n! * LaguerreL[n, -1].
E.g.f.: exp(x) * Sum_{n>=0} x^n/n!^2 = Sum_{n>=0} a(n)*x^n/n!^2. - Paul D. Hanna, Nov 18 2011
From Peter Bala, Oct 11 2012: (Start)
Denominators in the sequence of convergents coming from Stieltjes's continued fraction for A073003, the Euler-Gompertz constant G := Integral_{x = 0..oo} 1/(1+x)*exp(-x) dx:
G = 1/(2 - 1^2/(4 - 2^2/(6 - 3^2/(8 - ...)))). See [Wall, Chapter 18, (92.7) with a = 1]. The sequence of convergents to the continued fraction begins [1/2, 4/7, 20/34, 124/209, ...]. The numerators are in A002793. (End)
G.f.: 1 = Sum_{n>=0} a(n) * x^n * (1 - (n+1)*x)^2. - Paul D. Hanna, Nov 27 2012
E.g.f.: exp(x/(1-x))/(1-x) = G(0)/(1-x) where G(k) = 1 + x/((2*k+1)*(1-x) - x*(1-x)*(2*k+1)/(x + (1-x)*(2*k+2)/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, Dec 28 2012
a(n) = Sum_{k=0..n} L(n,k)*(k+1); L(n,k) the unsigned Lah numbers. - Peter Luschny, Oct 18 2014
a(n) = n! * A160617(n)/A160618(n). - Alois P. Heinz, Jun 28 2017
0 = a(n)*(-24*a(n+2) +99*a(n+3) -78*a(n+4) +17*a(n+5) -a(n+6)) +a(n+1)*(-15*a(n+2) +84*a(n+3) -51*a(n+4) +6*a(n+5)) +a(n+2)*(-6*a(n+2) +34*a(n+3) -15*a(n+4)) +a(n+3)*(+10*a(n+3)) for all n>=0. - Michael Somos, Jul 31 2018
a(n) = Sum_{k=0..n} C(n,k)*k!*A000262(n-k). - Geoffrey Critzer, Jan 07 2023
a(n) = A000262(n+1) - n * A000262(n). - Werner Schulte, Mar 29 2024
a(n) = denominator of (1 + n/(1 + n/(1 + (n-1)/(1 + (n-1)/(1 + ... + 1/(1 + 1/(1))))))). See A000262 for the numerators. - Peter Bala, Feb 11 2025

2nd description from R. H. Hardin, Nov 1997

3rd description from Wouter Meeussen, Jun 01 1998

A073003 Decimal expansion of -exp(1)*Ei(-1), also called Gompertz's constant, or the Euler-Gompertz constant.

Original entry on oeis.org

5, 9, 6, 3, 4, 7, 3, 6, 2, 3, 2, 3, 1, 9, 4, 0, 7, 4, 3, 4, 1, 0, 7, 8, 4, 9, 9, 3, 6, 9, 2, 7, 9, 3, 7, 6, 0, 7, 4, 1, 7, 7, 8, 6, 0, 1, 5, 2, 5, 4, 8, 7, 8, 1, 5, 7, 3, 4, 8, 4, 9, 1, 0, 4, 8, 2, 3, 2, 7, 2, 1, 9, 1, 1, 4, 8, 7, 4, 4, 1, 7, 4, 7, 0, 4, 3, 0, 4, 9, 7, 0, 9, 3, 6, 1, 2, 7, 6, 0, 3, 4, 4, 2, 3, 7

Offset: 0

Robert G. Wilson v, Aug 03 2002

0! - 1! + 2! - 3! + 4! - 5! + ... = (Borel) Sum_{n>=0} (-y)^n n! = KummerU(1,1,1/y)/y.
Decimal expansion of phi(1) where phi(x) = Integral_{t>=0} e^-t/(x+t) dt. - Benoit Cloitre, Apr 11 2003
The divergent series g(x=1,m) = 1^m*1! - 2^m*2! + 3^m*3! - 4^m*4! + ..., m => -1, is intimately related to Gompertz's constant. We discovered that g(x=1,m) = (-1)^m * (A040027(m) - A000110(m+1) * A073003) with A000110 the Bell numbers and A040027 a sequence that was published by Gould, see for more information A163940. - Johannes W. Meijer, Oct 16 2009
Named by Le Lionnais (1983) after the English self-educated mathematician and actuary Benjamin Gompertz (1779 - 1865). It was named the Euler-Gompertz constant by Finch (2003). Lagarias (2013) noted that he has not located this constant in Gompertz's writings. - Amiram Eldar, Aug 15 2020

			0.59634736232319407434107849936927937607417786015254878157348491...
With n := 10^5, Sum_{k >= 0} (n/(n + 1))^k/(n + k) = 0.5963(51...). - _Peter Bala_, Jun 19 2024

Bruce C. Berndt, Ramanujan's notebooks Part II, Springer, p. 171
Bruce C. Berndt, Ramanujan's notebooks Part I, Springer, p. 144-145.
S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 303, 424-425.
Francois Le Lionnais, Les nombres remarquables, Paris: Hermann, 1983. See p. 29.
Jerome Spanier and Keith B. Oldham, "Atlas of Functions", Hemisphere Publishing Corp., 1987, chapter 44, page 426.
H. S. Wall, Analytic Theory of Continued Fractions, Van Nostrand, New York, 1948, p. 356.

Robert Price, Table of n, a(n) for n = 0..10000
A. I. Aptekarev, On linear forms containing the Euler constant, arXiv:0902.1768 [math.NT], 2009. - _R. J. Mathar_, Feb 14 2009
Richard P. Brent, M. L. Glasser, and Anthony J. Guttmann, A Conjectured Integer Sequence Arising From the Exponential Integral, arXiv:1812.00316 [math.NT], 2018.
Xiangyu Ding and Lisa Hui Sun, Proof of Merca's stronger conjecture on truncated Jacobi triple product series, arXiv:2411.13818 [math.NT], 2024. See p. 20.
G. H. Hardy, Divergent Series, Oxford University Press, 1949. p. 29. - _Johannes W. Meijer_, Oct 16 2009
Jeffrey C. Lagarias, Euler's constant: Euler's work and modern developments, Bull. Amer. Math. Soc., Vol. 50, No. 4 (2013), pp. 527-628, preprint, arXiv:1303.1856 [math.NT], 2013.
István Mezo, Gompertz constant, Gregory coefficients and a series of the logarithm function, Journal of Analysis & Number Theory, Vol. 2, No. 2 (2014), pp. 33-36.
Michael Penn, why some series are "regularizable", YouTube video (2023).
Simon Plouffe, -exp(1)*Ei(-1).
Tanguy Rivoal, On the arithmetic nature of the values of the gamma function, Euler's constant, and Gompertz's constant, Michigan Math. J., Vol. 61, No. 2 (2012), pp. 239-254.
Ed Sandifer, Divergent Series, How Euler Did It, MAA Online, June 2006. - _Johannes W. Meijer_, Oct 16 2009
Eric Weisstein's World of Mathematics, Gompertz Constant.
Eric Weisstein's World of Mathematics, Exponential Integral.

Cf. A000522 (arrangements), A001620, A000262, A002720, A002793, A058006 (alternating factorial sums), A091725, A099285, A153229, A201203, A245780, A283743 (Ei(1)/e), A321942, A369883.

SetDefaultRealField(RealField(100)); ExponentialIntegralE1(1)*Exp(1); // G. C. Greubel, Dec 04 2018

RealDigits[N[-Exp[1]*ExpIntegralEi[-1], 105]][[1]]
(* Second program: *)
G = 1/Fold[Function[2*#2 - #2^2/#1], 2, Reverse[Range[10^4]]] // N[#, 105]&; RealDigits[G] // First (* Jean-François Alcover, Sep 19 2014 *)

eint1(1)*exp(1) \\ Charles R Greathouse IV, Apr 23 2013

numerical_approx(exp_integral_e(1,1)*exp(1), digits=100) # G. C. Greubel, Dec 04 2018

phi(1) = e*(Sum_{k>=1} (-1)^(k-1)/(k*k!) - Gamma) = 0.596347362323194... where Gamma is the Euler constant.
G = 0.596347... = 1/(1+1/(1+1/(1+2/(1+2/(1+3/(1+3/(1+4/(1+4/(1+5/(1+5/(1+6/(... - Philippe Deléham, Aug 14 2005
Equals A001113*A099285. - Johannes W. Meijer, Oct 16 2009
From Peter Bala, Oct 11 2012: (Start)
Stieltjes found the continued fraction representation G = 1/(2 - 1^2/(4 - 2^2/(6 - 3^2/(8 - ...)))). See [Wall, Chapter 18, (92.7) with a = 1]. The sequence of convergents to the continued fraction begins [1/2, 4/7, 20/34, 124/209, ...]. The numerators are in A002793 and the denominators in A002720.
Also, 1 - G has the continued fraction representation 1/(3 - 2/(5 - 6/(7 - ... -n*(n+1)/((2*n+3) - ...)))) with convergents beginning [1/3, 5/13, 29/73, 201/501, ...]. The numerators are in A201203 (unsigned) and the denominators are in A000262.
(End)
G = f(1) with f solution to the o.d.e. x^2*f'(x) + (x+1)*f(x)=1 such that f(0)=1. - Jean-François Alcover, May 28 2013
From Amiram Eldar, Aug 15 2020: (Start)
Equals Integral_{x=0..1} 1/(1-log(x)) dx.
Equals Integral_{x=1..oo} exp(1-x)/x dx.
Equals Integral_{x=0..oo} exp(-x)*log(x+1) dx.
Equals Integral_{x=0..oo} exp(-x)/(x+1) dx. (End)
From Gleb Koloskov, May 01 2021: (Start)
Equals Integral_{x=0..1} LambertW(e/x)-1 dx.
Equals Integral_{x=0..1} 1+1/LambertW(-1,-x/e) dx. (End)
Equals lim_{n->oo} A040027(n)/A000110(n+1). - Vaclav Kotesovec, Feb 22 2021
G = lim_{n->oo} A321942(n)/A000262(n). - Peter Bala, Mar 21 2022
Equals Sum_{n >= 1} 1/(n*L(n, -1)*L(n-1, -1)), where L(n, x) denotes the n-th Laguerre polynomial. This is the case x = 1 of the identity Integral_{t >= 0} exp(-t)/(x + t) dt = Sum_{n >= 1} 1/(n*L(n, -x)*L(n-1, -x)) valid for Re(x) > 0. - Peter Bala, Mar 21 2024
Equals lim_{n->oo} Sum_{k >= 0} (n/(n + 1))^k/(n + k). Cf. A099285. - Peter Bala, Jun 18 2024

Additional references from Gerald McGarvey, Oct 10 2005

Link corrected by Johannes W. Meijer, Aug 01 2009

A201203 Alternating row sums of triangle A201201: first associated monic Laguerre-Sonin(e) polynomials with parameter alpha=1 evaluated at x=-1.

Original entry on oeis.org

1, -5, 29, -201, 1631, -15173, 159093, -1854893, 23788271, -332613321, 5033396573, -81929955953, 1426898945343, -26468817431501, 520884561854501, -10836674357638293, 237603001692915983, -5475288709200573713, 132276033079845108621

Offset: 0

Wolfdieter Lang, Dec 06 2011

G. C. Greubel, Table of n, a(n) for n = 0..440
Michael Wallner, A bijection of plane increasing trees with relaxed binary trees of right height at most one, arXiv:1706.07163 [math.CO], 2017, Table 2 on p. 13.

Cf. A201201, A201202 (row sums), A073003, A002793.

A201203 := proc(n)
    add((-1)^k*A201201(n,k),k=0..n) ;
end proc:
seq(A201203(n),n=0..20) ; # R. J. Mathar, Dec 07 2011

Flatten[{1,RecurrenceTable[{n*(1+n)*a[-2+n]+(3+2*n)*a[-1+n] +a[n]==0, a[1]==-5,a[2]==29}, a, {n, 20}]}] (* Vaclav Kotesovec, Oct 19 2013 *)

a(n) = Sum_{k=0..n} ((-1)^k)*A201201(n,k), n>=0.
a(n)+(2*n+3)*a(n-1)+n*(n+1)*a(n-2)=0, a(-1)=0, a(0)=1. - R. J. Mathar, Dec 07 2011
From Wolfdieter Lang, Dec 11 2011: (Start)
E.g.f. from A201201 with x=-1, z->x: g(x) = exp(1/(1+x))*(3+2*x)*(exp(-1) + (Ei(1,1/(1+x))-Ei(1,1)))/(1+x)^4-(2+x)/(1+x)^3, with the exponential integral Ei.
This e.g.f. satisfies the homogeneous ordinary second-order differential equation (1+x)^2*(d^2(g(x))/dx^2) + (7+6*x)*(d(g(x))/dx)+6*g(x), with g(0)=1 and (d(g(x))/dx){x=0} = -5. This is equivalent to the recurrence conjectured above by _R. J. Mathar, which is thus proved.
(End)
Let G denote Gompertz's constant A073003. The unsigned sequence is the sequence of numerators in the convergents coming from the infinite continued fraction expansion 1 - G = 1/(3 - 2/(5 - 6/(7 - ... - n*(n+1)/((2*n+3) - ...)))). The sequence of convergents begins [1/3, 5/13, 29/73, 201/501, ...]. The denominators are in A000262. - Peter Bala, Aug 19 2013
a(n) ~ (-1)^n * 2^(-1/2)*(exp(-1)-Ei(1,1)) * exp(2*sqrt(n)-n+1/2) * n^(n+7/4) * (1+91/(48*sqrt(n))), where Ei(1,1) = 0.21938393439552... = G / exp(1), where G = 0.596347362323194... is the Gompertz constant (see A073003). - Vaclav Kotesovec, Oct 19 2013

R. J. Mathar conjecture corrected and proved by Wolfdieter Lang, Dec 11 2011

A199577 Coefficient triangle of the associated Laguerre polynomials of order 1.

Original entry on oeis.org

1, -3, 1, 11, -8, 1, -50, 58, -15, 1, 274, -444, 177, -24, 1, -1764, 3708, -2016, 416, -35, 1, 13068, -33984, 23544, -6560, 835, -48, 1, -109584, 341136, -288360, 101560, -17370, 1506, -63, 1, 1026576, -3733920, 3736440, -1595040, 343410, -39900, 2513, -80, 1

Offset: 0

Wolfdieter Lang, Nov 25 2011

Associated monic polynomials of order m (a nonnegative integer) in one variable, p_n(m;x), have the coefficients of the three-term recurrence of the original orthogonal monic polynomials p_n(x)=p_n(0;x) shifted by +m, and use the same inputs for n=-1 and n=0, namely 0 and 1, respectively. See, e.g., the Ismail reference, p. 27, Definition (2.3.4), where the notation is P_n(x;c) = p_n(c;x).
p_n(x)=p_n(0;x) and p_{n-1}(1;x) provide the fundamental system for the three-term recurrence of p_n(x) with general input.
p_{n-1}(1;x)/p_n(0;x) is the n-th approximation to the Jacobi continued fraction related to the three-term recurrence.
The monic row polynomials are La_n(1;x) = Sum_{k=0..n} a(n,k)*x^k, with the monic Laguerre polynomials La_n(x), which have the three-term recurrence
  La_n(x) = (x - (2*n - 1))*La_{n-1}(x) - (n - 1)^2*La_{n-2}(x), La_{-1}(x) = 0, La_0(x) = 1.
In the Ismail reference the non-monic associated Laguerre polynomials of order 1 appear on p. 160 in Theorem 5.6.1, eq. 5.6.11. The connection is: La_n(1;x)= L_n^{(alpha=0)}(x;1)*(n+1)!*(-1)^n.
From Wolfdieter Lang, Dec 04 2011: (Start)
The e.g.f. gLa(z,x) for La_n(1;x) can be obtained from the o.g.f. G(z,x) for the non-monic version L_n^{(alpha=0)}(x;1) by gLa(z,x)=(d/dz)(z*G(-z,x)).
  G(z,x) satisfies the ordinary first-order inhomogeneous differential equation, derived from the recurrence:
  (d/dz)G(z,x) = (2/(1-z)+(1-x)/(1-z)^2-1/(z*(1-z)^2))* G(z,x) + 1/(z*(1-z)^2), with G(0,x)=1. The standard solution is:
  G(z,x) = exp(-x/(1-z))*(Ei(1,-x) - Ei(1,-x/(1-z)))/(z*(1-z)), with the exponential integral Ei(1,y) = Integral_{t = y..oo} exp(-t)/t. From this the e.g.f. gLa(z,x), given in the Formula section, results. (End)
Note that these are not the associated Laguerre polynomials as usually defined in the literature. - Peter Bala, Mar 22 2024

			n\k      0        1       2        3      4    5  6   7
0:       1
1:      -3        1
2:      11       -8       1
3:     -50       58     -15        1
4:     274     -444     177      -24      1
5:   -1764     3708   -2016      416    -35    1
6:   13068   -33984   23544    -6560    835  -48   1
7: -109584   341136 -288360   101560 -17370 1506 -63  1
...

M. E. H. Ismail (two chapters by W. Van Assche), Classical and Quantum Orthogonal Polynomials in One Variable, Cambridge University Press, 2005.

Cf. A021009 (Laguerre), A199578 (row sums), A002793(n+1)*(-1)^n (alternating row sums, conjecture). [This conjecture has been proved by Wolfdieter Lang, Dec 12 2011]

Ei[1, y_] := -ExpIntegralEi[-y];
(cc = CoefficientList[#, x]; cc (Length[cc]-1)!)& /@ CoefficientList[(1 - Exp[-x/(1+z)] (1 - x/(1+z)) (Ei[1, -x/(1+z)] - Ei[1, -x]))/(1+z)^2 + O[z]^9, z] // Flatten (* Jean-François Alcover, Oct 28 2019 *)

p(n) = numerator(bestapprPade(Ser(vector(2*n, k, (k-1)!))));
concat(vector(9, n, Vec((-1)^(n-1)*p(n))))  \\ Gheorghe Coserea, Dec 01 2016

T(n,k) = [x^k] La_n(1; x), n >= 0, k = 0,...,n, with the three-term recurrence of the row polynomials: La_n(1; x) = (x - (2*n + 1))*La_{n-1}(1; x) - (n^2)* La_{n-2}(1; x), with La_{-1}(1; x) = 0, La_0(1; x) = 1.
The e.g.f. for La_n(1; x) is (1 - exp(-x/(1+z))*(1-x/(1+z))*(Ei(1,-x/(1+z)) - Ei(1,-x)))/(1+z)^2, with the exponential integral Ei. See the comments section for the definition and the proof. - Wolfdieter Lang, Dec 04 2011
n-th row polynomial = (-1)^n*(n+1)!*L(n+1, x)*Sum_{k = 0..n+1} 1/(k*L(k, x)*L(k-1, x)), where L(k, x) denotes the k-th Laguerre polynomial. See A021009. - Peter Bala, Mar 22 2024

cp's OEIS Frontend

A002720 Number of partial permutations of an n-set; number of n X n binary matrices with at most one 1 in each row and column.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

PARI

PARI

PARI

PARI

Python

SageMath

Formula

Extensions

A073003 Decimal expansion of -exp(1)*Ei(-1), also called Gompertz's constant, or the Euler-Gompertz constant.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Formula

Extensions

A201203 Alternating row sums of triangle A201201: first associated monic Laguerre-Sonin(e) polynomials with parameter alpha=1 evaluated at x=-1.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A199577 Coefficient triangle of the associated Laguerre polynomials of order 1.

Views

Author

Keywords

Comments

Examples

References

Crossrefs

Programs

Mathematica

PARI

Formula

A056952 Numerators of continued fraction for alternating factorial.

Views

Author

Keywords

Crossrefs

Formula

Extensions

A199578 Row sums of coefficient triangle of the monic associated Laguerre polynomials of order 1.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula