9864101

Appears in sequences

• Total number of ordered k-tuples (k=0..n) of distinct elements from an n-element set: a(n) = Sum_{k=0..n} n!/k!.at n=10A000522
• Numerator of Sum_{k=0..n} 1/k!.at n=10A061354
• Number of graphs with n nodes. Nodes and edges labeled each from their own label set.at n=5A091479
• Triangle read by rows: T(n,k) is the number of deco polyominoes of height n having along the lower contour exactly k reentrant corners, i.e., a vertical step that is followed by a horizontal step (n>=1, k>=0).at n=30A121579
• Triangle read by rows: T(n,k) is the number of deco polyominoes of height n such that the bottom of the last column is at level k (n>=1; k>=0). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=46A121632
• Squarefree part of the total number of arrangements of a set with n elements.at n=10A222637
• Pairs p, q for those partial sums p/q of the series e = sum_{n>=0} 1/n! that are not convergents to e.at n=16A233044
• Number T(n,k) of permutations p of [n] such that k is the maximum of the partial sums of the signed up-down jump sequence of 0,p; triangle T(n,k), n>=0, ceiling((sqrt(1+8*n)-1)/2)<=k<=n, read by rows.at n=42A316292
• Square array T(n,k), n>=0, k>=0, read by antidiagonals, where T(n,k) = n! * Sum_{j=0..n} j^k/j!.at n=65A337085
• Nearest integer to e*n!.at n=10A370973