28401

Appears in sequences

• Number of positions that are exactly n moves from the starting position in the Rashkey Type 2 puzzle.at n=12A079864
• Antidiagonal sums of square array A082025.at n=33A082190
• a(n) = P_n(9), where P_n is n-th Legendre polynomial; also, a(n) = central coefficient of (1 + 9*x + 20*x^2)^n.at n=4A084769
• Consider the triangle in which the j-th row begins with prime(j) and is the arithmetic progression with least common difference such that the remaining j-1 terms are composite and not divisible by prime(j). Sequence gives last term in each row.at n=38A095182
• P_4(2n+1), the Legendre polynomial of order 4 at 2n+1.at n=4A144124
• 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, 0), (0, 1, -1), (1, -1, 1), (1, 1, 1)}.at n=8A149722
• 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), (-1, 1, 0), (0, 0, 1), (1, 0, -1), (1, 0, 1)}.at n=8A150400
• Variation on Delannoy array/triangle; based on a triangular sum with the base multiplied by 2.at n=47A165251
• Number of length 2+2 0..n arrays with the sum of second differences squared multiplied by some arrangement of +-1 equal to zero.at n=29A250321
• Rectangular array A(n, k) = hypergeom([-k, k + n/2 - 1], [1], -4) with row n >= 0 and k >= 0, read by ascending antidiagonals.at n=40A300945
• Array read by antidiagonals: T(n,k) is the number of chiral pairs of color patterns (set partitions) in a cycle of length n using k or fewer colors (subsets).at n=116A320742
• Number of chiral pairs of color patterns (set partitions) in a cycle of length n using 4 or fewer colors (subsets).at n=11A320744
• a(n) = Sum_{k=0..n} binomial(n,k) * binomial(n+k,k) * n^k.at n=4A331656
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of 1/sqrt(1 - 2*(2*k+1)*x + x^2).at n=40A335333
• a(n) = Sum_{k=0..floor(n/2)} k^k * Stirling2(n-k,k).at n=10A353287