29808

Appears in sequences

• Numbers n such that log_pi(n) is closer to an integer than is log_pi(m) for any m with 2<=m<n.at n=7A080022
• a(n) = n^3 + 17.at n=31A084379
• The PDO(n) function (Partitions with Designated summands in which all parts are Odd): the sum of products of multiplicities of parts in all partitions of n into odd parts.at n=41A102186
• Numbers k such that k = A074206(k), the number of ordered factorizations of k.at n=6A163272
• Numbers with 50 divisors.at n=6A175756
• Terms of A177763 which have more than one such representation.at n=23A177766
• Numbers with prime factorization pq^4r^4.at n=6A190012
• (n-1)-st elementary symmetric function of the first n terms of (3,1,2,3,1,2,3,1,2,...).at n=12A203161
• Number of nX3 0..1 arrays of the median of the corresponding element, the element to the east and the element to the south in a larger (n+1)X4 0..1 array.at n=4A228981
• Number of nX5 0..1 arrays of the median of the corresponding element, the element to the east and the element to the south in a larger (n+1)X6 0..1 array.at n=2A228983
• T(n,k) = number of nXk 0..1 arrays of the median of the corresponding element, the element to the east and the element to the south in a larger (n+1)X(k+1) 0..1 array.at n=23A228986
• T(n,k) = number of nXk 0..1 arrays of the median of the corresponding element, the element to the east and the element to the south in a larger (n+1)X(k+1) 0..1 array.at n=25A228986
• a(n) = 23*n^2.at n=36A244632
• E.g.f. satisfies A(x) = 1 - log(1 - x*A(x)^3)/A(x)^3.at n=6A377350
• Numbers that have exactly two exponents in their prime factorization that are equal to 4.at n=8A386805