46550

Appears in sequences

• Total area of all n-celled polyominoes.at n=9A057766
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (0, 0, 1), (1, -1, 1), (1, 0, -1)}.at n=12A148028
• Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 7, n >= 2.at n=30A214503
• Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 5, n >= 2.at n=41A214563
• Number T(n,k) of endofunctions on [n] such that at least one preimage with cardinality k exists and, if j is the largest value with a nonempty preimage, the preimage cardinality of i is >=k for all i<=j and equal to k for at least one i<=j; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=29A245733
• Number of preferential arrangements of n labeled elements such that the minimal number of elements per rank equals 1.at n=6A245854
• a(n) = cpg(n, 3) + cpg(n, 4) + ... + cpg(n, n) where cpg(n, m) is the m-th n-th-order centered polygonal number.at n=23A257051
• G.f. A(x) satisfies: A( x^2*A(x) - x^2*A(x)^2 ) = x^3.at n=11A272463
• a(n) = T(n, 3), where T(n, k) = Sum_{i=0..n} i^k * binomial(n, i) * (1/2)^(n-k).at n=35A366151
• Triangle read by rows where T(n,k) is the number of labeled loop-graphs with n vertices and n edges, k of which are loops.at n=32A368928
• a(n) is the number of binary strings of length n whose shortest run of 1s is of length 2.at n=20A384154