1058400

Appears in sequences

• A simple context-free grammar in a labeled universe: labeled version of A052703.at n=7A052730
• Triangle T(n,k) read by rows: number of labeled trees with n nodes and k leaves, n >= 2, 2 <= k <= n.at n=31A055314
• Number of labeled trees with n nodes and 5 leaves.at n=3A055317
• a(n) = total number of occurrences of the consecutive pattern 1324 in all permutations of [n+3].at n=6A061206
• Numbers k such that sigma(k) - usigma(k) > 3k.at n=1A063875
• Least common multiple of the first n terms of A002473 (7-smooth numbers).at n=29A085911
• Least common multiple of the first n terms of A002473 (7-smooth numbers).at n=30A085911
• Least common multiple of the first n terms of A002473 (7-smooth numbers).at n=33A085911
• Least common multiple of the first n terms of A002473 (7-smooth numbers).at n=31A085911
• Least common multiple of the first n terms of A002473 (7-smooth numbers).at n=34A085911
• Least common multiple of the first n terms of A002473 (7-smooth numbers).at n=32A085911
• Triangle read by rows: T(n,k) is the number of permutations p of [n] in which the length of the longest initial segment avoiding the 123-, the 132- and the 321-pattern is equal to k.at n=47A094067
• Triangle of coefficients associate with the expansion of the K_3 graph matric characteristic polynomial as a Sheffer sequence: M = {{0, 1, 1}, {1, 0, 1}, {1, 1, 0}} f(t)=-t^3+3t+2 p(x,t)=1/(2*t^3+3*t^2-1)^x=1/(t^3*f(1/t))^x.at n=23A137946
• Triangle of unsigned 2-Lah numbers.at n=29A143497
• Triangle read by rows: T(n,k) is the number of fixed-point-free involutions of {1,2,...,2n} having k cycles with entries of opposite parities (0 <= k <= n).at n=40A161119
• Triangle read by rows: T(n,k) is the number of fixed-point-free involutions of {1,2,...,2n} having k cycles with entries of the same parity (0 <= k <= 2*floor(n/2)).at n=36A161121
• Triangle read by rows: T(n,k) = binomial(n,k)*(binomial(n-1,k-1)*binomial(n+1,k+1) + binomial(n-1,k)*binomial(n+1,k)), with T(0,0) = 1.at n=48A174148
• Triangle read by rows: T(n,k) = binomial(n,k)*(binomial(n-1,k-1)*binomial(n+1,k+1) + binomial(n-1,k)*binomial(n+1,k)), with T(0,0) = 1.at n=51A174148
• Irregular triangle T(n,k) = n!* A036040(n,k), read by rows, 1 <= k <= A000041(n).at n=39A178882
• Number of non-attacking placements of 4 rooks on an n X n board.at n=9A179059