26432

Appears in sequences

• Associated Stirling numbers: second-order reciprocal Stirling numbers (Fekete) a(n) = [[n, 3]]. The number of 3-orbit permutations of an n-set with at least 2 elements in each orbit.at n=3A000483
• Second-order reciprocal Stirling number (Fekete) a(n) = [[2n+3, n]]. The number of n-orbit permutations of a (2n+3)-set with at least 2 elements in each orbit. Also known as associated Stirling numbers of the first kind (e.g., Comtet).at n=3A001784
• Triangle T(n,k) read by rows: associated Stirling numbers of first kind (n >= 2, 1 <= k <= floor(n/2)).at n=18A008306
• Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 81.at n=33A031579
• Triangle T(n,k) read by rows; related to number of preorders.at n=33A079510
• Triangle T(n,k) read by rows: associated Stirling numbers of first kind (n >= 0 and 0 <= k <= floor(n/2)).at n=28A106828
• T(n, k) = [x^k] (-1)^n*Sum_{k=0..n} E2(n, n-k)*(1+x)^(n-k) where E2(n, k) are the second-order Eulerian numbers. Triangle read by rows, T(n, k) for n >= 1 and 0 <= k <= n.at n=18A111999
• Number of partitions of n with odd crank.at n=42A124228
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (1, 0, -1), (1, 0, 1), (1, 1, 1)}.at n=8A150716
• a(n) = 4^n + 10*2^n + 4*3^n + 20.at n=7A254366
• Fourth partial sums of seventh powers (A001015).at n=3A254646
• Triangle read by rows, giving coefficients in an expansion of absolute values of Stirling numbers of the first kind in terms of binomial coefficients.at n=17A259456
• Triangle read by rows, T(n, k) = Sum_{m=0..k} (-1)^(m + k)*binomial(n + k, n + m) * |Stirling1(n + m, m)|, for n >= 0, 0 <= k <= n.at n=24A269940
• a(n) is the smallest k > 15 such that the density of semiprimes in 1..k is 1/n.at n=1A296653
• a(n) = A330575(A025487(n)).at n=41A333962
• Number of integer partitions of n of even length whose greatest multiplicity is at most half their length.at n=44A338914
• Numbers k such that abs(A328258(k)) = abs(A328258(k+1)).at n=28A348586
• Regular triangle read by rows. T(n, k) = [[n, k]], where [[n, k]] are the second order Stirling cycle numbers (or second order reciprocal Stirling numbers). T(n, k) for 0 <= k <= n.at n=48A358622
• Triangle read by rows: T(n, k) = A358125(n,k)*binomial(n-1, k), 0 <= k <= n-1.at n=39A359200
• Triangle read by rows: T(n, k) = A358125(n,k)*binomial(n-1, k), 0 <= k <= n-1.at n=41A359200