389340
domain: N
Appears in sequences
- Number of (n+1) X (4+1) arrays of permutations of 0..n*5+4 with each element having directed index change 1,0 1,1 0,-1 or -1,1.at n=8A264565
- T(n, k) = ((2*n + 1)/2)*Sum_{j, k, n} (-1)^(k + j)*(n + j)*binomial(2*n, n - j)* Stirling2(n - k + j, 1 - k + j) with T(0, 0) = 1. Triangle read by row, T(n, k) for 0 <= k <= n.at n=31A342312
- Place n equally spaced points around the circumference of a circle and then, for each pair of points, draw two distinct circles, whose radii are the same as the first circle, such that both points lie on their circumferences. The sequence gives the total number of (curved) edges formed.at n=34A371375