39760

Appears in sequences

• T(n,k) is the number of partial bijections (or subpermutations) of an n-element set of height k (height(alpha) = |Im(alpha)|) and with exactly 2 fixed points.at n=24A144091
• Numbers k such that 11^phi(k) == 1 (mod k^2), where phi(k) = A000010(k).at n=24A253016
• Number of (n+2)X(6+2) 0..3 arrays with every consecutive three elements in every row and column not having exactly two distinct values, and in every diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=21A253023
• Numbers n = p * q, where n, p, and q together contain all 10 digits at least once.at n=53A253172
• G.f.: Product_{i>0} Sum_{j>=0} (-1)^j*j!*x^(j*i).at n=8A293236
• Number of (binary) heaps of length n whose element set equals [k] (for some k <= n).at n=9A373452