25947

Appears in sequences

• a(n) = Sum_t t*F(n,t), where F(n,t) (see A033185) is the number of rooted forests with n (unlabeled) nodes and exactly t rooted trees.at n=11A005197
• Discriminants of totally complex sextic fields (negated).at n=22A023687
• Numerators of convergents to twin prime constant.at n=10A065647
• L-th order palindromes with L > 2.at n=20A089381
• Number of distinct partitions of triangular numbers n*(n+1)/2 into 3 parts for n>=1.at n=32A104385
• Numbers of the form p^2 * q^3, where p,q are distinct primes.at n=37A143610
• Numbers of the form 20*k+7 which are three times a square.at n=18A192328
• Numbers of the form p^2*q^3 where p, q are (not necessarily distinct) primes.at n=41A216417
• Positive integers n that are equal to the determinant of the circulant matrix formed by the binary digits of n.at n=2A219325
• Total sum of parts of multiplicity 7 in all partitions of n.at n=42A222735
• a(n) = 27*n^2.at n=31A244634
• Either 8th power of a prime, or product of a square and a cube of two different primes.at n=39A272191
• If n = Product (p_j^k_j) then a(n) = Product (prime(p_j)^prime(k_j)).at n=43A321874
• a(n) = numerator of Product_{d|n} (sigma(d)/tau(d)) where sigma(k) = the sum of the divisors of k (A000203) and tau(k) = the number of divisors of k (A000005).at n=49A324509
• Numbers that are the product of distinct primes with prime subscripts raised to prime powers.at n=36A346068
• Numbers > 1 that are not a prime power and whose prime indices and exponents are all themselves prime numbers.at n=16A352518
• Number of quaternary steady words of length n (with respect to the permutations of symbols).at n=46A357250
• Achilles numbers that are deficient.at n=33A379164
• Position of first appearance of n in A290106 (product of prime indices divided by product of distinct prime indices).at n=43A380987
• Odd Achilles numbers.at n=20A390953