740880

Appears in sequences

• Triangle read by rows, the Bell transform of (n+2)!/2 without column 0.at n=29A046089
• E.g.f.: Product_{m >= 1} (1+x^(2*m)/(2*m)) (even powers only).at n=5A087639
• Variant sequence generated by solving the order n X n linear problem [H]x = b where b is the unit vector and the sequence term is given by the denominator of the last unknown xn.at n=10A124266
• Unsigned third column (k=2) of triangle A136656 divided by 4.at n=6A136659
• Triangle T(n,k), n>=0, 0<=k<=n, read by rows: T(n,k) = number of simple graphs on n labeled nodes with k edges where each maximally connected subgraph consists of a single node or has a unique cycle of length 4.at n=52A144209
• a(n) = 4*(n^4-n^3).at n=20A160538
• Triangle T(n, k) = round(c(n)/(c(k)*c(n-k))) where c(n) = ((n-1)! * n! * (n+1)!)/ 2^(n-1) if n >= 2, otherwise 1, read by rows.at n=49A174150
• Triangle T(n, k) = round(c(n)/(c(k)*c(n-k))) where c(n) = ((n-1)! * n! * (n+1)!)/ 2^(n-1) if n >= 2, otherwise 1, read by rows.at n=50A174150
• Triangle T(n, k) = c(n)/(c(k)*c(n-k)) where c(n) = 12*Product_{j=3..n} ( 12 * binomial(j+2, 4) ) with c(0) = c(1) = 1, read by rows.at n=31A174151
• Triangle T(n, k) = c(n)/(c(k)*c(n-k)) where c(n) = 12*Product_{j=3..n} ( 12 * binomial(j+2, 4) ) with c(0) = c(1) = 1, read by rows.at n=32A174151
• Area A of the triangles such that A, the sides and two medians are integers.at n=21A181928
• Array read by antidiagonals: a(i,j) is the number of ways of labeling a tableau of shape (i,1^j) with the integers 1, 2, ... i+j-2 (each label being used once) such that the first row is decreasing, and the first column has m-1 labels.at n=48A226167
• Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.at n=38A249253