1351350

Appears in sequences

• Triangle giving T(n,k) = number of (n,k) labeled rooted Greg trees (n >= 1, 0<=k<=n-1).at n=34A048160
• Triangle of coefficients of Bessel polynomials {y_n(x)}'.at n=32A065931
• Triangle of coefficients of Bessel polynomials {y_n(x)}''.at n=25A065943
• Denominator of b(n), where b(n+1) = Sum_{k=0..n} b'((n^2-k^2)/n), b(0) = b(1) = 1, and b'(x) = b(x) if x is an integer and is linearly interpolated otherwise.at n=14A071301
• Triangle read by rows: row n gives number of matchings of size 0<=k<=n (edges) in the complete graph on 2*n >= 2 vertices.at n=39A119743
• Triangle, read by rows, defined by T(n,k) = A000108(n-k)*A001147(k)*C(n,2*k), for k=0..[n/2], n>=0, where A000108 is the Catalan numbers and A001147 is the double factorials.at n=33A125080
• Exponential Riordan array [1/sqrt(1-2x), x/(1-2x)].at n=40A176230
• Coefficient array of orthogonal polynomials whose moment sequence is the double factorial numbers A001147.at n=40A176231
• Denominators of Integral_{x=0..Pi/2} sin(2*n*x)*log(cosec(x)) dx.at n=15A225123
• Triangle T(n,k) giving denominator of integral_{x=0..1} B(n,x)*B(k,x) dx, B = Bernoulli polynomial, n >= 1, 1 <= k <= n.at n=31A225750
• a(n) = (2^floor(n+n/2)/sqrt(Pi)^mod(n+1,2))*Gamma(n+1/2)/Gamma(n/2+1).at n=8A264152
• Triangle read by rows, the denominators of the Bell transform of B(2n,1) where B(n,x) are the Bernoulli polynomials.at n=48A265603
• Least positive integer k with exactly n odd divisors greater than sqrt(2*k).at n=39A281008
• Number T(n,k) of linear chord diagrams having n chords and maximal chord length k (or k=0 if n=0); triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=44A293961
• Number of linear chord diagrams having n chords and maximal chord length n, a(0)=1.at n=8A293962
• a(n) is the least positive integer divisible by exactly n primitive nondeficient numbers (A006039).at n=15A337691
• T(n, k) = [x^k] (1/2 - x)^(-n) - (1 - x)^(-n).at n=40A356117
• a(n) = binomial(4*n, 2*n)*(2*n)!/(2^n*n!).at n=4A359761
• Expansion of e.g.f. 1 / ( 1 - Sum_{k>=0} x^(3*k+4) / (3*k+4)! ).at n=15A365913
• a(n) is the least number k that has exactly n divisors <= sqrt(k) of the form 4*j+3.at n=27A379683