117390

Appears in sequences

• a(n) is the number of labeled rooted trees on a set of size n where each node has at most 4 neighbors that are further away from the root than the node itself.at n=7A036776
• Products of exactly 6 distinct primes.at n=29A067885
• Numbers n such that the denominator of the 2n-th Bernoulli number is divisible by n but sum_{d|n} sigma(d)/phi(d) is not an integer.at n=31A099008
• Composite numbers n such that n+2 is also composite and such that (sopfr(n), sopfr(n+2)) is a twin prime pair. A001414 explains notation 'sopfr(n)'.at n=10A247048
• Numbers k such that usigma(k) >= 3*k, where usigma(k) = sum of unitary divisors of k (A034448).at n=21A285615
• a(n) = n*(n + 1)*(16*n - 1)/6.at n=35A304659
• Square array whose entry A(n,k) is the number of labeled rooted trees on a set of size n where each node has at most k neighbors that are further away from the root than the node itself, for n >= 0, k >= 0, read by descending antidiagonals.at n=73A325201
• Squarefree 3-abundant numbers: squarefree numbers k such that A000203(k) > 3*k.at n=21A387153