2827440

Appears in sequences

• Smallest numbers having exactly n divisors d>1 such that also d+1 is a divisor.at n=29A088726
• Sum of all n-digit superabundant numbers.at n=5A132386
• Where records occur in A129308 and also in A195155.at n=22A195307
• Smallest number k such that the symmetric representation of sigma(k) has at least one part of width n.at n=31A250070
• Positions of records in A266344.at n=22A266345
• Triangle read by rows, T(n,k) = (-1)^k*(2*n)!*P[n,k](1/(n+1)) where P is the P-transform, for n>=0 and 0<=k<=n.at n=23A268437
• Ramanujan's largely composite numbers n (A067128) which are not divisible by all the primes < p, where p is the greatest prime divisor of n.at n=32A273379
• Numbers k for which sigma(k) - 4k exceeds sigma(j) - 4j for all j < k.at n=29A279091
• Least k such that the number of pairs of consecutive divisors of k equals n.at n=30A287142
• Where records occur in A322373.at n=39A322374
• Numbers that are a smallest number with k pairs of successive divisors, for some k.at n=29A328450
• Numbers m such that A357761(m) < A357761(k) for all k < m.at n=31A357764
• Numbers k that set records in A372720.at n=33A371630
• Triangle read by rows: T(n, k) = (Sum_{i=0..n-k} (-1)^i * binomial(n-k, i) * A007559(n-i)) * n! / ((n-k)! * A007559(k)) for 0 <= k <= n.at n=32A372921