35664

Appears in sequences

• a(n) = n! * Sum_{k=ceiling(n/2)..n} 1/k.at n=7A101611
• n! * Sum[k=floor(n/2)..n, 1/k].at n=6A101612
• (2n)! * Sum[k=n..2n, 1/k].at n=3A101613
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} whose 2nd cycle has k entries; each cycle is written with the smallest element first and cycles are arranged in increasing order of their first elements (n>=1; 0<=k<=n-1). For example, 1432=(1)(24)(3) has 2 entries in the 2nd cycle; 3421=(1324) has 0 entries in the 2nd cycle.at n=40A138771
• a(n) = (2*n^3 + 5*n^2 + 21*n)/2.at n=31A162266
• Number of permutations p on the set [n] with the properties that abs(p(i)-i) <= 3 for all i and p(1) <= 2.at n=11A188494
• Triangle of coefficients of polynomials v(n,x) jointly generated with A208930; see the Formula section.at n=52A208930
• a(n) = (1/2)*A291036(n).at n=10A291037
• Number of product-free subsets of {1..n}.at n=18A326489
• Numbers k such that 2^k + 3^k + 6 is prime.at n=35A354829
• Triangle read by rows: T(n,k) = numerators of "across the board" style tournament payouts.at n=31A388733
• Number of integer partitions of n > 0 such that the least and greatest parts are not both odd (equivalently, their product is even).at n=42A391230