34009

Appears in sequences

• Number T(n,k) of entries in the k-th cycles of all permutations of {1,2,..,n}; each cycle is written with the smallest element first and cycles are arranged in increasing order of their first elements.at n=40A185105
• Numbers n such that the n-th digit (after the decimal point) in the decimal expansion of Pi are the occurrence of the least significant digit represented by the more significant digits.at n=22A201545
• Number of partitions of n such that (greatest part) - (least part) < number of parts.at n=42A237830
• Composite numbers k such that sigma(k + sigma(k)) = 2*sigma(k).at n=32A246858
• Odd numbers m such that for all 2^k < m the numbers m + 2^k, m - 2^k, m*2^k + 1, and m*2^k - 1 are composite, with k >= 1.at n=4A256163
• Number of entries in the fifth cycles of all permutations of [n].at n=4A285233