29252

Appears in sequences

• Expansion of (1-x)/(1-x-x^3-x^4+x^5).at n=28A052532
• Number of bracelet structures using a maximum of three different colored beads.at n=14A056353
• 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, -1), (0, 0, 1), (0, 1, 0), (0, 1, 1), (1, 0, 1)}.at n=7A151243
• Number of permutations of 1..n with all differences of elements separated by distances 1 through 4 being respectively unique.at n=12A170810
• Number of partitions of n such that (greatest part) - (least part) >= number of parts.at n=42A237834
• Triangle T(n,k) read by rows: number of simple connected graphs with n nodes and k endpoints, n >= 0, 0 <= k <= n.at n=58A304222
• a(0) = 1; a(n) = Sum_{k=1..n} (-1)^(k+1) * binomial(n,k)^2 * binomial(2*k,k) * a(n-k).at n=5A336271
• Square array read by descending antidiagonals. T(n,k) is the number of ways to separate the columns of an ordered pair of n-permutations (that have been written as a 2 X n array, one atop the other) into k cells so that no cell has a column rise. For n >= 0, k >= 0.at n=33A340986