59136

Appears in sequences

• a(n) = 2^n*C(n+6,6). Number of 6D hypercubes in an (n+6)-dimensional hypercube.at n=6A002409
• E.g.f. tan(sin(x)*cos(x)) (odd powers only).at n=4A009670
• Triangle read by rows: T(n,k) (n >= 2, 0 <= k <= n) = number of over-all crude totals of unbranched k-5-catapolyheptagons.at n=48A038195
• a(n) = 2^n * (2*n)! / (n!)^2.at n=6A059304
• Nearest integer to log(n!)^(1 + log(1 + log(n))).at n=32A062444
• Triangle T(n,k) = d(n-k,n), 0 <= k <= n, where d(l,m) = Sum_{k=l..m} 2^k * binomial(2*m-2*k, m-k) * binomial(m+k, m) * binomial(k, l).at n=21A067001
• Number of rooted unicursal planar maps with n edges and exactly one vertex of valency 1 (unicursal means that exactly two vertices are of odd valency; there is an Eulerian path).at n=6A069722
• Numbers n such that A001414(n) = sum of composites from the smallest prime factor of n to the largest prime factor of n.at n=29A074053
• E.g.f. BesselI(0,2*sqrt(2)*x) + BesselI(1,2*sqrt(2)*x)/sqrt(2).at n=12A098660
• Triangle, read by rows, of trinomial coefficients arranged so that there are n+1 terms in row n by setting T(n,k) equal to the coefficient of z^k in (2 + 3*z + z^2)^(n-[k/2]), for n>=k>=0, where [k/2] is the integer floor of k/2.at n=48A099527
• Triangle read by rows: T(n,k) is number of noncrossing trees with n edges and having k branches.at n=48A101452
• Expansion of (sqrt(1-8*x^2)+8*x^2+2*x-1)/(2*x*sqrt(1-8*x^2)).at n=12A103973
• Riordan array (1/(1-2x),x/(1-2x)^2).at n=48A114192
• Number of tree-rooted maps of genus 2 with n edges: rooted maps with a distinguished spanning tree on an orientable surface of genus 2.at n=2A118446
• Coefficients of a polynomial representation of the integral of 1/(x^4 + 2*a*x^2 + 1)^(n+1) from x = 0 to infinity.at n=27A126936
• Number triangle T(n,k) = 2^(n-k)*C(2*n,n-k).at n=21A128417
• Partial sums of A129379.at n=7A129380
• If X_1,...,X_n is a partition of a 2n-set X into 2-blocks then a(n) is equal to the number of 6-subsets of X containing none of X_i, (i=1,...n).at n=6A130812
• Triangle T(n,k) with the coefficient of [x^k] of the polynomial (2*(x+1)^2)^n in row n, column k, 0<=k<=2n.at n=42A139548
• Triangle T(n, k) = Sum_{j=0..n} (2*n)!/((2*n-k-j)!*j!*k!), read by rows.at n=27A141723