27480

Appears in sequences

• Number of rooted trees with 3 nodes of disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children.at n=8A005173
• Triangle of succession numbers for circular permutations.at n=58A134832
• Fourth column (k=3) of triangle A134832 (circular succession numbers).at n=7A135801
• Triangle, read by rows, T(n,k) = binomial(n+k+1, n+1) * Sum_{j=0..k} j!*binomial(n,j)*binomial(k, j).at n=24A176121
• E.g.f.: logarithm of G(x)/x where G(x) = ... x*exp(x^4) o x*exp(x^3) o x*exp(x^2) o x*exp(x), a composition of functions x*exp(x^n) for n = 1,2,3,...at n=5A277182
• Numbers k such that (14*10^k - 221)/9 is prime.at n=20A282383
• Number of 5-cycles in the n-triangular honeycomb obtuse knight graph.at n=31A290391
• Number of (undirected) paths in the complete bipartite graph K_{m,n} (triangle read by rows with m = 1..n and n = 1..).at n=18A307027
• Number of regions formed by infinite lines when connecting all vertices and all points that divide the sides of an equilateral triangle into n equal parts.at n=9A343755
• Array read by antidiagonals: T(m,n) is the number of (undirected) paths in the complete bipartite graph K_{m,n}.at n=39A360850
• Array read by antidiagonals: T(m,n) is the number of (undirected) paths in the complete bipartite graph K_{m,n}.at n=41A360850
• Expansion of Sum_{k>=1} k^3 * x^k/(1 - x^k)^3.at n=23A366135
• Expansion of g.f. x*(21 + 123*x + 129*x^2 + 4*x^3 + 129*x^4 + 123*x^5 + 21*x^6)/((1 - x)^3*(1 + x + x^2 + x^3)^2).at n=39A377166