43653

Appears in sequences

• Triangle giving a(n,k) = number of (n,k) labeled Greg trees (n >= 2, 0 <= k <= n-2).at n=16A048159
• a(n+1) is the smallest odd m whose cototient equals a(n).at n=12A063830
• Numerator of (1+1/n)^k - (1+k/n), 2<=k<=n, triangle read by rows.at n=19A099613
• Triangle T(n,k) = ((-1)^(n+k)/(n+1))*Sum_{j=0..n} (-1)^j*j!*Stirling2(n, j)* binomial(n-j, k)*binomial(n+j, j), read by rows.at n=17A156653
• Number of nX3 0..1 arrays with no more than floor(nX3/2) elements unequal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..1 order.at n=8A222698
• Array read by antidiagonals: T(n,k) = number of lattice paths from (0,0) to (n,k) using steps (1,0), (0,1), (1,1), (-1,1) and whose points lie entirely in the integer rectangle of lattice points {(i, j): 0 <= i <= n, 0 <= j <= k}.at n=51A232968
• Triangle of coefficients of quasi-Stirling polynomials.at n=19A331998