316008

Appears in sequences

• Stanley's children's game. Class of n (named) children forms into rings with exactly one child inside each ring. We allow the case when outer ring has only one child. a(n) gives number of possibilities, including clockwise order (or which hand is held), in each ring.at n=7A066166
• Number of permutations of order n avoiding the consecutive pattern 11'22'.at n=10A177470
• Numbers with prime factorization pqrs^3t^3.at n=19A190385
• a(n) = 12*binomial(n, 5).at n=22A300847
• Square array T(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of e.g.f. (1 - x)^(-x^k).at n=64A355609
• Square array T(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of e.g.f. (1 - x)^(-x^k/k!).at n=64A355610
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = (-1)^n * n! * Sum_{j=0..floor(n/2)} k^j * Stirling1(n-j,j)/(n-j)!.at n=64A362834
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = (-1)^n * n! * Sum_{j=0..floor(n/2)} k^(n-j) * Stirling1(n-j,j)/(n-j)!.at n=64A362837