A081358 -id:A081358 - cp's OEIS frontend

A000254 Unsigned Stirling numbers of first kind, s(n+1,2): a(n+1) = (n+1)*a(n) + n!.

0, 1, 3, 11, 50, 274, 1764, 13068, 109584, 1026576, 10628640, 120543840, 1486442880, 19802759040, 283465647360, 4339163001600, 70734282393600, 1223405590579200, 22376988058521600, 431565146817638400, 8752948036761600000, 186244810780170240000

Offset: 0

N. J. A. Sloane

Number of permutations of n+1 elements with exactly two cycles.
Number of cycles in all permutations of [n]. Example: a(3) = 11 because the permutations (1)(2)(3), (1)(23), (12)(3), (13)(2), (132), (123) have 11 cycles altogether. - Emeric Deutsch, Aug 12 2004
Row sums of A094310: In the symmetric group S_n, each permutation factors into k independent cycles; a(n) = sum k over S_n. - Harley Flanders (harley(AT)umich.edu), Jun 28 2004
The sum of the top levels of the last column over all deco polyominoes of height n. A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column. Example: a(2)=3 because the deco polyominoes of height 2 are the vertical and horizontal dominoes, the levels of their last columns being 2 and 1, respectively. - Emeric Deutsch, Aug 12 2006
a(n) is divisible by n for all composite n >= 6. a(2*n) is divisible by 2*n + 1. - Leroy Quet, May 20 2007
For n >= 2 the determinant of the n-1 X n-1 matrix M(i,j) = i + 2 for i = j and 1 otherwise (i,j = 1..n-1). E.g., for n = 3 the determinant of [(3, 1), (1, 4)]. See 53rd Putnam Examination, 1992, Problem B5. - Franz Vrabec, Jan 13 2008, Mar 26 2008
The numerator of the fraction when we sum (without simplification) the terms in the harmonic sequence. (1 + 1/2 = 2/2 + 1/2 = 3/2; 3/2 + 1/3 = 9/6 + 2/6 = 11/6; 11/6 + 1/4 = 44/24 + 6/24 = 50/24;...). The denominator of this fraction is n!*A000142. - Eric Desbiaux, Jan 07 2009
The asymptotic expansion of the higher order exponential integral E(x,m=2,n=1) ~ exp(-x)/x^2*(1 - 3/x + 11/x^2 - 50/x^3 + 274/x^4 - 1764/x^5 + 13068/x^6 - ...) leads to the sequence given above. See A163931 and A028421 for more information. - Johannes W. Meijer, Oct 20 2009
a(n) is the number of permutations of [n+1] containing exactly 2 cycles. Example: a(2) = 3 because the permutations (1)(23), (12)(3), (13)(2) are the only permutations of [3] with exactly 2 cycles. - Tom Woodward (twoodward(AT)macalester.edu), Nov 12 2009
It appears that, with the exception of n= 4, a(n) mod n = 0 if n is composite and = n-1 if n is prime. - Gary Detlefs, Sep 11 2010
a(n) is a multiple of A025527(n). - Charles R Greathouse IV, Oct 16 2012
Numerator of harmonic number H(n) = Sum_{i=1..n} 1/i when not reduced. See A001008 (Wolstenholme numbers) for the reduced numerators. - Rahul Jha, Feb 18 2015
The Stirling transform of this sequence is A222058(n) (Harmonic-geometric numbers). - Anton Zakharov, Aug 07 2016
a(n) is the (n-1)-st elementary symmetric function of the first n numbers. - Anton Zakharov, Nov 02 2016
The n-th iterated integral of log(x) is x^n * (n! * log(x) - a(n))/(n!)^2 + a polynomial of degree n-1 with arbitrary coefficients. This can be proven using the recurrence relation a(n) = (n-1)! + n*a(n-1). - Mohsen Maesumi, Oct 31 2018
Primes p such that p^3 | a(p-1) are the Wolstenholme primes A088164. - Amiram Eldar and Thomas Ordowski, Aug 08 2019
Total number of left-to-right maxima (or minima) in all permutations of [n]. a(3) = 11 = 3+2+2+2+1+1: (1)(2)(3), (1)(3)2, (2)1(3), (2)(3)1, (3)12, (3)21. - Alois P. Heinz, Aug 01 2020

			(1-x)^-1 * (-log(1-x)) = x + 3/2*x^2 + 11/6*x^3 + 25/12*x^4 + ...
G.f. = x + x^2 + 5*x^3 + 14*x^4 + 94*x^5 + 444*x^6 + 3828*x^7 + 25584*x^8 + ...

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 833.
A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, identities 186-190.
N. Bleistein and R. A. Handelsman, Asymptotic Expansions of Integrals, Dover Publications, 1986, see page 2. MR0863284 (89d:41049)
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 217.
F. N. David, M. G. Kendall and D. E. Barton, Symmetric Function and Allied Tables, Cambridge, 1966, p. 226.
Shanzhen Gao, Permutations with Restricted Structure (in preparation).
K. Javorszky, Natural Orders: De Ordinibus Naturalibus, 2016, ISBN 978-3-99057-139-2.
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).

Seiichi Manyama, Table of n, a(n) for n = 0..449 (terms 0..100 from T. D. Noe)
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
E. Barcucci, A. Del Lungo and R. Pinzani, "Deco" polyominoes, permutations and random generation, Theoretical Computer Science, 159 (1996), 29-42.
J.-L. Baril and S. Kirgizov, The pure descent statistic on permutations, preprint, 2016.
FindStat - Combinatorial Statistic Finder, The number of cycles in the cycle decomposition of a permutation.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 31.
Sergey Kitaev and Jeffrey Remmel, Simple marked mesh patterns, arXiv:1201.1323 [math.CO], 2012.
Sergey Kitaev and Jeffrey Remmel, Quadrant Marked Mesh Patterns, J. Int. Seq. 15 (2012), #12.4.7.
Chanchal Kumar and Amit Roy, Integer Sequences and Monomial Ideals, arXiv:2003.10098 [math.CO], 2020.
Mircea Merca, Some experiments with complete and elementary symmetric functions, Periodica Mathematica Hungarica, 69 (2014), 182-189.
J. Riordan, Letter of 04/11/74.
John A. Rochowicz Jr., Harmonic Numbers: Insights, Approximations and Applications, Spreadsheets in Education (eJSiE), 8(2) (2015), Article 4.
N. A. Rosenberg, Informativeness of genetic markers for inference of ancestry, American Journal of Human Genetics 73 (2003), 1402-1422.
M. D. Schmidt, Generalized j-Factorial Functions, Polynomials, and Applications, J. Int. Seq. 13 (2010), #10.6.7, Section 4.3.2.
J. Scholes, 53rd Putnam 1992, Problem B5.
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)
Jun Yan, Results on pattern avoidance in parking functions, arXiv:2404.07958 [math.CO], 2024. See p. 5.

Cf. A000399, A000454, A000482, A001233, A001234, A243569, A243570.
Cf. A000774, A004041, A024167, A046674, A049034, A008275.
Cf. A021009, A081358, A092691, A094587, A151881, A121633.
With signs: A081048.
Column 1 in triangle A008969.
Row sums of A136662.

a:=[]; for n in [1..22] do a:=a cat [Abs(StirlingFirst(n,2))]; end for; a; // Marius A. Burtea, Jan 01 2020

A000254 := proc(n) option remember; if n<=1 then n else n*A000254(n-1)+(n-1)!; fi; end: seq(A000254(n),n=0..21);
a := n -> add(n!/k, k=1..n): seq(a(n), n=0..21); # Zerinvary Lajos, Jan 22 2008

Table[ (PolyGamma[ m ]+EulerGamma) (m-1)!, {m, 1, 24} ] (* Wouter Meeussen *)
Table[ n!*HarmonicNumber[n], {n, 0, 19}] (* Robert G. Wilson v, May 21 2005 *)
Table[Sum[1/i,{i,1,n}]/Product[1/i,{i,1,n}],{n,1,30}] (* Alexander Adamchuk, Jul 11 2006 *)
Abs[StirlingS1[Range[20],2]] (* Harvey P. Dale, Aug 16 2011 *)
Table[Gamma'[n + 1] /. EulerGamma -> 0, {n, 0, 30}] (* Li Han, Feb 14 2024*)

a(n):=(-1)^(n+1)/2*(n+1)*sum(k*bern(k-1)*stirling1(n,k),k,1,n); /* Vladimir Kruchinin, Nov 20 2016 */

A000254 := proc(n) begin n*A000254(n-1)+fact(n-1) end_proc: A000254(1) := 1:

{a(n) = if( n<0, 0, (n+1)! / 2 * sum( k=1, n, 1 / k / (n+1-k)))} /* Michael Somos, Feb 05 2004 */

[stirling_number1(i, 2) for i in range(1, 22)]  # Zerinvary Lajos, Jun 27 2008

Let P(n,X) = (X+1)*(X+2)*(X+3)*...*(X+n); then a(n) is the coefficient of X; or a(n) = P'(n,0). - Benoit Cloitre, May 09 2002
Sum_{k > 0} a(k) * x^k/ k!^2 = exp(x) *(Sum_{k>0} (-1)^(k+1) * x^k / (k * k!)). - Michael Somos, Mar 24 2004; corrected by Warren D. Smith, Feb 12 2006
a(n) is the coefficient of x^(n+2) in (-log(1-x))^2, multiplied by (n+2)!/2.
a(n) = n! * Sum_{i=1..n} 1/i = n! * H(n), where H(n) = A001008(n)/A002805(n) is the n-th harmonic number.
a(n) ~ 2^(1/2)*Pi^(1/2)*log(n)*n^(1/2)*e^-n*n^n. - Joe Keane (jgk(AT)jgk.org), Jun 06 2002
E.g.f.: log(1 - x) / (x-1). (= (log(1 - x))^2 / 2 if offset 1). - Michael Somos, Feb 05 2004
D-finite with recurrence: a(n) = a(n-1) * (2*n - 1) - a(n-2) * (n - 1)^2, if n > 1. - Michael Somos, Mar 24 2004
a(n) = A081358(n)+A092691(n). - Emeric Deutsch, Aug 12 2004
a(n) = n!*Sum_{k=1..n} (-1)^(k+1)*binomial(n, k)/k. - Vladeta Jovovic, Jan 29 2005
p^2 divides a(p-1) for prime p > 3. a(n) = (Sum_{i=1..n} 1/i) / Product_{i=1..n} 1/i. - Alexander Adamchuk, Jul 11 2006
a(n) = 3* A001710(n) + 2* A001711(n-3) for n > 2; e.g., 11 = 3*3 + 2*1, 50 = 3*12 + 2*7, 274 = 3*60 + 2*47, ... - Gary Detlefs, May 24 2010
a(n) = A138772(n+1) - A159324(n). - Gary Detlefs, Jul 05 2010
a(n) = A121633(n) + A002672(n). - Gary Detlefs, Jul 18 2010
a(n+1) = Sum_{i=1..floor((n-1)/2)} n!/((n-i)*i) + Sum_{i=ceiling(n/2)..floor(n/2)} n!/(2*(n-i)*i). - Shanzhen Gao, Sep 14 2010
From Gary Detlefs, Sep 11 2010: (Start)
a(n) = (a(n-1)*(n^2 - 2*n + 1) + (n + 1)!)/(n - 1) for n > 2.
It appears that, with the exception of n = 2, (a(n+1)^2 - a(n)^2) mod n^2 = 0 if n is composite and 4*n if n is prime.
It appears that, with the exception of n = 2, (a(n+1)^3 - a(n)^2) mod n = 0 if n is composite and n - 2 if n is prime.
It appears that, with the exception of n = 2, (a(n)^2 + a(n+1)^2) mod n = 0 if n is composite and = 2 if n is prime. (End)
a(n) = Integral_{x=0..oo} (x^n - n!)*log(x)*exp(-x) dx. - Groux Roland, Mar 28 2011
a(n) = 3*n!/2 + 2*(n-2)!*Sum_{k=0..n-3} binomial(k+2,2)/(n-2-k) for n >= 2. - Gary Detlefs, Sep 02 2011
a(n)/(n-1)! = ml(n) = n*ml(n-1)/(n-1) + 1 for n > 1, where ml(n) is the average number of random draws from an n-set with replacement until the total set has been observed. G.f. of ml: x*(1 - log(1 - x))/(1 - x)^2. - Paul Weisenhorn, Nov 18 2011
a(n) = det(|S(i+2, j+1)|, 1 <= i,j <= n-2), where S(n,k) are Stirling numbers of the second kind. - Mircea Merca, Apr 06 2013
E.g.f.: x/(1 - x)*E(0)/2, where E(k) = 2 + E(k+1)*x*(k + 1)/(k + 2). - Sergei N. Gladkovskii, Jun 01 2013 [Edited by Michael Somos, Nov 28 2013]
0 = a(n) * (a(n+4) - 6*a(n+3) + 7*a(n+2) - a(n+1)) - a(n+1) * (4*a(n+3) - 6*a(n+2) + a(n+1)) + 3*a(n+2)^2 unless n=0. - Michael Somos, Nov 28 2013
For a simple way to calculate the sequence, multiply n! by the integral from 0 to 1 of (1 - x^n)/(1 - x) dx. - Rahul Jha, Feb 18 2015
From Ilya Gutkovskiy, Aug 07 2016: (Start)
Inverse binomial transform of A073596.
a(n) ~ sqrt(2*Pi*n) * n^n * (log(n) + gamma)/exp(n), where gamma is the Euler-Mascheroni constant A001620. (End)
a(n) = ((-1)^(n+1)/2*(n+1))*Sum_{k=1..n} k*Bernoulli(k-1)*Stirling1(n,k). - Vladimir Kruchinin, Nov 20 2016
a(n) = (n)! * (digamma(n+1) + gamma), where gamma is the Euler-Mascheroni constant A001620. - Pedro Caceres, Mar 10 2018
From Andy Nicol, Oct 21 2021: (Start)
Gamma'(x) = a(x-1) - (x-1)!*gamma, where Gamma'(x) is the derivative of the gamma function at positive integers and gamma is the Euler-Mascheroni constant. E.g.:
Gamma'(1) = -gamma, Gamma'(2) = 1-gamma, Gamma'(3) = 3-2*gamma,
Gamma'(22) = 186244810780170240000 - 51090942171709440000*gamma. (End)
From Peter Bala, Feb 03 2022: (Start)
The following are all conjectural:
E.g.f.: for nonzero m, (1/m)*Sum_{n >= 1} (-1)^(n+1)*(1/n)*binomial(m*n,n)* x^n/(1 - x)^(m*n+1) = x + 3*x^2/2! + 11*x^3/3! + 50*x^4/4! + ....
For nonzero m, a(n) = (1/m)*n!*Sum_{k = 1..n} (-1)^(k+1)*(1/k)*binomial(m*k,k)* binomial(n+(m-1)*k,n-k).
a(n)^2 = (1/2)*n!^2*Sum_{k = 1..n} (-1)^(k+1)*(1/k^2)*binomial(n,k)* binomial(n+k,k). (End)
From Mélika Tebni, Jun 20 2022: (Start)
a(n) = -Sum_{k=0..n} k!*A021009(n, k+1).
a(n) = Sum_{k=0..n} k!*A094587(n, k+1). (End)
a(n) = n! * 1/(1 - 1^2/(3 - 2^2/(5 - 3^2/(7 - ... - (n - 1)^2/((2*n - 1)))))). - Peter Bala, Mar 16 2024

A024167 a(n) = n!*(1 - 1/2 + 1/3 - ... + c/n), where c = (-1)^(n+1).

Original entry on oeis.org

1, 1, 5, 14, 94, 444, 3828, 25584, 270576, 2342880, 29400480, 312888960, 4546558080, 57424792320, 948550176000, 13869128448000, 256697973504000, 4264876094976000, 87435019510272000, 1627055289796608000, 36601063093905408000, 754132445894209536000

Offset: 1

Clark Kimberling

Stirling transform of (-1)^n*a(n-1) = [0, 1, -1, 5, -14, 94, ...] is A000629(n-2) = [0, 1, 2, 6, 26, ...]. - Michael Somos, Mar 04 2004
Stirling transform of a(n) = [1, 1, 5, 14, 94, ...] is A052882(n) = [1, 2, 9, 52, 375, ...]. - Michael Somos, Mar 04 2004
a(n) is the number of n-permutations that have a cycle with length greater than n/2. - Geoffrey Critzer, May 28 2009
From Jens Voß, May 07 2010: (Start)
a(4n) is divisible by 6*n + 1 for all n >= 1; the quotient of a(4*n) and 6*n+1 is A177188(n).
a(4*n+3) is divisible by 6*n + 5 for all n >= 0; the quotient of a(4*n+3) and 6*n + 5 is A177174(n). (End)

			G.f. = x + x^2 + 5*x^3 + 14*x^4 + 94*x^5 + 444*x^6 + 3828*x^7 + 25584*x^8 + ...

Seiichi Manyama, Table of n, a(n) for n = 1..449

Cf. A024168, A000254, A054651, A094587, A142979, A177174, A177188.

a := n -> n!*(log(2) - (-1)^n*LerchPhi(-1, 1, n+1));
seq(simplify(a(n)), n=1..20); # Peter Luschny, Dec 27 2018

f[k_] := k (-1)^(k + 1)
t[n_] := Table[f[k], {k, 1, n}]
a[n_] := SymmetricPolynomial[n - 1, t[n]]
Table[a[n], {n, 1, 18}]    (* A024167 signed *)
(* Clark Kimberling, Dec 30 2011 *)
a[ n_] := If[ n < 0, 0, n! Sum[ -(-1)^k / k, {k, n}]]; (* Michael Somos, Nov 28 2013 *)
a[ n_] := If[ n < 0, 0, n! (PolyGamma[n + 1] - PolyGamma[(n + Mod[n, 2, 1]) / 2])]; (* Michael Somos, Nov 28 2013 *)
a[ n_] := If[ n < 1, 0, (-1)^Quotient[n, 2] SymmetricPolynomial[ n - 1, Table[ -(-1)^k k, {k, n}]]]; (* Michael Somos, Nov 28 2013 *)

{a(n) = if( n<0, 0, n! * polcoeff( log(1 + x + x * O(x^n)) / (1 - x), n))}; /* Michael Somos, Mar 02 2004 */

x='x+O('x^33); Vec(serlaplace(log(1+x)/(1-x))) \\ Joerg Arndt, Dec 27 2018

def A():
    a, b, n = 1, 1, 2
    yield(a)
    while True:
        yield(a)
        b, a = a, a + b * n * n
        n += 1
a = A(); print([next(a) for  in range(20)]) # _Peter Luschny, May 19 2020

E.g.f.: log(1 + x)/(1 - x). - Vladeta Jovovic, Aug 25 2002
a(n) = a(n-1) + a(n-2) * (n-1)^2, n > 1. - Michael Somos, Oct 29 2002
b(n) = n! satisfies the above recurrence with b(1) = 1, b(2) = 2. This gives the finite continued fraction expansion a(n)/n! = 1/(1 + 1^2/(1 + 2^2/(1 + 3^2/(1 + ... + (n-1)^2/1)))). Cf. A142979. - Peter Bala, Jul 17 2008
a(n) = A081358(n) - A092691(n). - Gary Detlefs, Jul 09 2010
E.g.f.: (x/(x-1))/G(0) where G(k) = -1 + (x-1)*k + x*(k+1)^2/G(k+1); (continued fraction, Euler's 1st kind, 1-step). - Sergei N. Gladkovskii, Aug 18 2012
a(n) ~ log(2)*n!. - Daniel Suteu, Dec 03 2016
a(n) = (1/2)*n!*((-1)^n*(digamma((n+1)/2) - digamma((n+2)/2)) + log(4)). - Daniel Suteu, Dec 03 2016
a(n) = n!*(log(2) - (-1)^n*LerchPhi(-1, 1, n+1)). - Peter Luschny, Dec 27 2018
a(n) = A054651(n,n-1). - Pontus von Brömssen, Oct 25 2020
a(n) = Sum_{k=0..n} (-1)^k*k!*A094587(n, k+1). - Mélika Tebni, Jun 20 2022
a(n) = n * a(n-1) - (-1)^n * (n-1)! for n > 1. - Werner Schulte, Oct 20 2024

More terms from Benoit Cloitre, Jan 27 2002

a(21)-a(22) from Pontus von Brömssen, Oct 25 2020

A092691 a(n) = n! * Sum_{k=1..floor(n/2)} 1/(2k).

Original entry on oeis.org

0, 0, 1, 3, 18, 90, 660, 4620, 42000, 378000, 4142880, 45571680, 586776960, 7628100480, 113020427520, 1695306412800, 28432576972800, 483353808537600, 9056055981772800, 172065063653683200, 3562946373482496000, 74821873843132416000, 1697172166720622592000

Offset: 0

Michael Somos, Mar 04 2004

nonn

Stirling transform of -(-1)^n*a(n-1)=[1,0,1,-3,18,...] is A052856(n-2)=[1,1,2,4,14,76,...].

Number of cycles of even cardinality in all permutations of [n]. Example: a(3)=3 because among (1)(2)(3), (1)(23), (12)(3), (13)(2), (132), (123) we have three cycles of even length. - Emeric Deutsch, Aug 12 2004

			a(4)=4!*(1/2+1/4)=18, a(5)=5!*(1/2+1/4)=90.

I. P. Goulden and D. M. Jackson, Combinatorial Enumeration, Wiley, N.Y., 1983, Exercise 3.3.13.

N. J. A. Sloane and T. D. Noe, Table of n, a(n) for n = 0..200

A046674(n)=a(2n). Cf. A081358, A151883, A151884.

nn = 20; Range[0, nn]! CoefficientList[
  D[Series[(1 - x^2)^(-y/2) ((1 + x)/(1 - x))^(1/2), {x, 0, nn}], y] /. y -> 1, x]  (* Geoffrey Critzer, Aug 27 2012 *)

PARI
```
a(n)=if(n<0,0,n!*sum(k=1,n\2,1/k)/2)
```

{a(n)=if(n<0, 0, n!*polcoeff( log(1-x^2+x*O(x^n))/(2*x-2), n))}

a(2n+1) = (2n+1)*a(2n).
From Vladeta Jovovic, Mar 06 2004: (Start)
a(n) = n!*(Psi(floor(n/2)+1)+gamma)/2.
E.g.f.: log(1-x^2)/(2*x-2). (End)
a(n) = n!/2*h(floor(n/2)), where h(n) = Sum_{k=1..n} 1/k. - Gary Detlefs, Jul 19 2011

A049034 Scaled sums of odd reciprocals.

Original entry on oeis.org

1, 8, 184, 8448, 648576, 74972160, 12174658560, 2643856588800, 740051782041600, 259500083163955200, 111422936937037824000, 57504006817918746624000, 35122852492484487413760000

Offset: 0

Joe Keane (jgk(AT)jgk.org)

nonn

a(n) mod n^2 = 2*n if n is an odd prime, otherwise 0. - Gary Detlefs, Apr 16 2012

			(arctanh x)^2 = x^2 + 2/3*x^4 + 23/45*x^6 + 44/105*x^8 + ...

Harvey P. Dale, Table of n, a(n) for n = 0..224

Bisection of A081358 and A092692: a(n) = A081358(2n+1) = A092692(2n+1).

Cf. A000254, A004041, A046674.

Module[{nn=25,c},c=Range[1,nn,2];Times@@@Thread[{Accumulate[1/c],c!}]](* Harvey P. Dale, Nov 20 2013 *)

{a(n)=if(n<0, 0, n=2*n+1; n!*sum(k=1, n, (k%2)/k))} /* Michael Somos, Sep 19 2006 */

a(n) = (2*n+1)! * sum[ k=0..n ] 1/(2*k+1).

E.g.f. (arctanh x)^2/2 = sum_n a(n)x^(2n+2)/(2n+2)! or (arctanh x)/(1-x^2) = sum_n a(n)x^(2n+1)/(2n+1)!.

A151883 Let g be a permutation of [1..n] having say j_i cycles of length i, with Sum_i i*j_i = n; sequence gives Sum_g Sum_{i even} (j_i)^2.

Original entry on oeis.org

0, 1, 3, 24, 120, 840, 5880, 54600, 491400, 5276880, 58045680, 749770560, 9747017280, 142685262720, 2140278940800, 35879056012800, 609943952217600, 11334678568012800, 215358892792243200, 4453151976335462400, 93516191503044710400, 2108447155238693068800

Offset: 1

N. J. A. Sloane, Jul 22 2009

nonn

N. J. A. Sloane and Alois P. Heinz, Table of n, a(n) for n = 1..450 (first 30 terms from N. J. A. Sloane)

Cf. A000254, A151881, A151882, A151884, A092691, A081358.

with(combinat):
b:= proc(n, i) option remember; `if`(n=0, [1,0], `if`(i<1, 0,
      add(multinomial(n,n-i*j,i$j)/j!*(i-1)!^j*(p-> p+
      `if`(i::even, [0, p[1]*j^2], 0))(b(n-i*j, i-1)), j=0..n/i)))
    end:
a:= n-> b(n$2)[2]:
seq(a(n), n=1..30);  # Alois P. Heinz, Oct 21 2015

multinomial[n_, k_] := n!/Times @@ (k!); b[n_, i_] := b[n, i] = If[n==0, {1, 0}, If[i<1, {0, 0}, Sum[multinomial[n, Join[{n-i*j}, Array[i&, j]]]/j! * (i-1)!^j * Function[p, p+If[EvenQ[i], {0, p[[1]]*j^2}, {0, 0}]][b[n-i*j, i-1]], {j, 0, n/i}]]]; a[n_] := b[n, n][[2]]; Table[a[n], {n, 1, 30}] (* Jean-François Alcover, Mar 13 2017, after Alois P. Heinz *)

A151884 Let g be a permutation of [1..n] having say j_i cycles of length i, with Sum_i i*j_i = n; sequence gives Sum_g Sum_{i odd} (j_i)^2.

Original entry on oeis.org

1, 4, 14, 56, 304, 1904, 14048, 112384, 1051776, 10662912, 120920832, 1451049984, 19342651392, 272576268288, 4175822315520, 66813157048320, 1156746459709440, 20900477925457920, 403511454289428480, 8070229085788569600, 171907712809736601600

Offset: 1

N. J. A. Sloane, Jul 22 2009

nonn

N. J. A. Sloane and Alois P. Heinz, Table of n, a(n) for n = 1..450 (first 30 terms from N. J. A. Sloane)

Cf. A000254, A151881, A151882, A151883, A081358, A092691.

with(combinat):
b:= proc(n, i) option remember; `if`(n=0, [1,0], `if`(i<1, 0,
      add(multinomial(n,n-i*j,i$j)/j!*(i-1)!^j*(p-> p+
      `if`(i::odd, [0, p[1]*j^2], 0))(b(n-i*j, i-1)), j=0..n/i)))
    end:
a:= n-> b(n$2)[2]:
seq(a(n), n=1..30);  # Alois P. Heinz, Oct 21 2015

multinomial[n_, k_List] := n!/Times @@ (k!); b[n_, i_] := b[n, i] = If[n==0, {1, 0}, If[i<1, {0, 0}, Sum[multinomial[n, Join[{n-i*j}, Array[i&, j]]]/j!*(i-1)!^j*Function[p, p+If[OddQ[i], {0, p[[1]]*j^2}, {0, 0}]][b[n-i*j, i-1]], {j, 0, n/i}]]]; a[n_] := b[n, n][[2]]; Table[a[n], {n, 1, 30}] (* Jean-François Alcover, Mar 13 2017, after Alois P. Heinz *)

A296726 Expansion of e.g.f. arcsin(x)/(1 - x).

Original entry on oeis.org

0, 1, 2, 7, 28, 149, 894, 6483, 51864, 477801, 4778010, 53451135, 641413620, 8446433085, 118250063190, 1792012416075, 28672198657200, 491536207523025, 8847651735414450, 169292834944205175, 3385856698884103500, 71531660838216529125, 1573696538440763640750

Offset: 0

Ilya Gutkovskiy, Dec 19 2017

nonn

			arcsin(x)/(1 - x) = x/1! + 2*x^2/2! + 7*x^3/3! + 28*x^4/4! + 149*x^5/5! + ...

Muhammad Adam Dombrowski and Gregory Dresden, Areas Between Cosines, arXiv:2404.17694 [math.CO], 2024.

Cf. A001147, A001818, A009551, A081358, A281964, A296727.

a:=series(arcsin(x)/(1 - x),x=0,23): seq(n!*coeff(a,x,n),n=0..22); # Paolo P. Lava, Mar 27 2019

nmax = 22; CoefficientList[Series[ArcSin[x]/(1 - x), {x, 0, nmax}], x] Range[0, nmax]!
nmax = 22; CoefficientList[Series[-I Log[I x + Sqrt[1 - x^2]]/(1 - x), {x, 0, nmax}], x] Range[0, nmax]!

first(n) = x='x+O('x^n); Vec(serlaplace(asin(x)/(1 - x)), -n) \\ Iain Fox, Dec 19 2017

E.g.f.: -i*log(i*x + sqrt(1 - x^2))/(1 - x), where i is the imaginary unit.
a(n) ~ n! * Pi/2. - Vaclav Kotesovec, Dec 20 2017
a(2*n) = 2*n*a(2*n-1). - Greg Dresden, Apr 04 2024
a(2*n+1) = (2*n+1)*(2*n)*a(2*n-1) + ((2*n-1)!!)^2, using the double factorial notation from A001147. - Greg Dresden, Apr 11 2024

A296727 Expansion of e.g.f. arcsinh(x)/(1 - x).

Original entry on oeis.org

0, 1, 2, 5, 20, 109, 654, 4353, 34824, 324441, 3244410, 34795485, 417545820, 5536151685, 77506123590, 1144330385625, 18309286170000, 315366695240625, 5676600514331250, 106667957800963125, 2133359156019262500, 45229212438054868125, 995042673637207098750, 22696937952367956440625

Offset: 0

Ilya Gutkovskiy, Dec 19 2017

nonn

			arcsinh(x)/(1 - x) = x/1! + 2*x^2/2! + 5*x^3/3! + 20*x^4/4! + 109*x^5/5! + ...

Cf. A001818, A009628, A081358, A186763, A281964, A296726.

a:=series(arcsinh(x)/(1 - x),x=0,24): seq(n!*coeff(a,x,n),n=0..23); # Paolo P. Lava, Mar 27 2019

nmax = 23; CoefficientList[Series[ArcSinh[x]/(1 - x), {x, 0, nmax}], x] Range[0, nmax]!
nmax = 23; CoefficientList[Series[Log[x + Sqrt[1 + x^2]]/(1 - x), {x, 0, nmax}], x] Range[0, nmax]!

first(n) = x='x+O('x^n); Vec(serlaplace(asinh(x)/(1 - x)), -n) \\ Iain Fox, Dec 19 2017

E.g.f.: log(x + sqrt(1 + x^2))/(1 - x).

a(n) ~ n! * log(1 + sqrt(2)). - Vaclav Kotesovec, Dec 20 2017

A102289 Total number of odd lists in all sets of lists, cf. A000262.

Original entry on oeis.org

0, 1, 2, 15, 76, 665, 5286, 56287, 597080, 7601841, 99702730, 1484554511, 23049638052, 393702612745, 7036703742446, 135702811542495, 2737989749177776, 58848546456947297, 1321063959370833810, 31310238786268648591, 773291778432688011260, 20031956775840631151481

Offset: 0

Vladeta Jovovic, Feb 19 2005

Alois P. Heinz, Table of n, a(n) for n = 0..444

Cf. A052852, A066897, A066898, A059570, A059570, A081358, A092691.

G:=(x/(1-x^2))*exp(x/(1-x)): Gser:=series(G,x=0,25): seq(n!*coeff(Gser,x^n),n=1..22); # Emeric Deutsch
# second Maple program:
b:= proc(n) option remember; `if`(n=0, [1, 0], add(
      (p-> p+`if`(j::odd, [0, p[1]], 0))(b(n-j)*
        binomial(n-1, j-1)*j!), j=1..n))
    end:
a:= n-> b(n, 0)[2]:
seq(a(n), n=0..25);  # Alois P. Heinz, May 10 2016

Rest[CoefficientList[Series[x/(1-x^2)*E^(x/(1-x)), {x, 0, 20}], x]* Range[0, 20]!] (* Vaclav Kotesovec, Sep 29 2013 *)
nxt[{n_,a_,b_,c_}]:={n+1,b,c,(n+1)*c+(n+1)^2*b-(n-1)^2 (n+1)*a}; NestList[ nxt,{2,0,1,2},30][[All,2]] (* Harvey P. Dale, Jan 13 2019 *)

E.g.f.: x/(1-x^2)*exp(x/(1-x)).
a(n) = n*a(n-1) + n^2*a(n-2) - (n-2)^2*n*a(n-3). - Vaclav Kotesovec, Sep 29 2013
a(n) ~ sqrt(2)/4 * n^(n+1/4)*exp(2*sqrt(n)-n-1/2) * (1 + 7/(48*sqrt(n))). - Vaclav Kotesovec, Sep 29 2013

More terms from Emeric Deutsch, Jun 24 2005

a(0)=0 pepended by Alois P. Heinz, May 10 2016

A102290 Total number of even lists in all sets of lists, cf. A000262.

Original entry on oeis.org

0, 0, 2, 6, 60, 380, 3990, 37002, 450296, 5373720, 76018410, 1096730030, 17814654132, 299645294676, 5511836578430, 105550556136690, 2171244984679920, 46545825736022192, 1059273836225051346, 25100215228045842390, 626204775725372971820, 16239127347086448236460

Offset: 0

Vladeta Jovovic, Feb 19 2005

Alois P. Heinz, Table of n, a(n) for n = 0..444
Index entries for sequences related to Laguerre polynomials

Cf. A052852, A059570, A066897, A066898, A081358, A092691.

l:= func< n,b | Evaluate(LaguerrePolynomial(n), b) >;
[0,0]cat[Factorial(n)*(&+[(-1)^(n+j)*l(j,-1): j in [0..n-2]]): n in [2..30]]; // G. C. Greubel, Mar 09 2021

Gser:=series(x^2*exp(x/(1-x))/(1-x^2),x=0,22):seq(n!*coeff(Gser,x^n),n=1..21); # Emeric Deutsch
# second Maple program:
b:= proc(n) option remember; `if`(n=0, [1, 0], add(
      (p-> p+`if`(j::even, [0, p[1]], 0))(b(n-j)*
        binomial(n-1, j-1)*j!), j=1..n))
    end:
a:= n-> b(n, 0)[2]:
seq(a(n), n=0..25);  # Alois P. Heinz, May 10 2016

Rest[CoefficientList[Series[x^2/(1-x^2)*E^(x/(1-x)), {x, 0, 20}], x]* Range[0, 20]!] (* Vaclav Kotesovec, Sep 29 2013 *)
Table[If[n<2, 0, n!*Sum[(-1)^(n-j)*LaguerreL[j, -1], {j,0,n-2}]], {n,0,30}] (* G. C. Greubel, Mar 09 2021 *)

[0,0]+[factorial(n)*sum((-1)^(n+j)*gen_laguerre(j,0,-1) for j in (0..n-2)) for n in (2..30)] # G. C. Greubel, Mar 09 2021

E.g.f.: x^2/(1-x^2)*exp(x/(1-x)).
Recurrence: (n-2)*a(n) = (n-2)*n*a(n-1) + (n-1)^2*n*a(n-2) - (n-3)*(n-2)*(n-1)*n*a(n-3). - Vaclav Kotesovec, Sep 29 2013
a(n) ~ sqrt(2)/4 * n^(n+1/4)*exp(2*sqrt(n)-n-1/2) * (1 - 41/(48*sqrt(n))). - Vaclav Kotesovec, Sep 29 2013
a(n) = n! * Sum_{j=0..n-2} (-1)^(n+j)*LaguerreL(j, -1) for n>1 with a(0)=a(1)=0. - G. C. Greubel, Mar 09 2021

More terms from Emeric Deutsch, Mar 27 2005

a(0)=0 prepended by Alois P. Heinz, May 10 2016

cp's OEIS Frontend

A000254 Unsigned Stirling numbers of first kind, s(n+1,2): a(n+1) = (n+1)*a(n) + n!.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Maxima

MuPAD

PARI

Sage

Formula

A024167 a(n) = n!*(1 - 1/2 + 1/3 - ... + c/n), where c = (-1)^(n+1).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Python

Formula

Extensions

A092691 a(n) = n! * Sum_{k=1..floor(n/2)} 1/(2k).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A049034 Scaled sums of odd reciprocals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A151883 Let g be a permutation of [1..n] having say j_i cycles of length i, with Sum_i i*j_i = n; sequence gives Sum_g Sum_{i even} (j_i)^2.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

A151884 Let g be a permutation of [1..n] having say j_i cycles of length i, with Sum_i i*j_i = n; sequence gives Sum_g Sum_{i odd} (j_i)^2.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

A296726 Expansion of e.g.f. arcsin(x)/(1 - x).