942480

Appears in sequences

• Maximal period of an n-stage shift register.at n=25A005417
• Row 6 of square array defined in A047662.at n=15A047663
• Denominator of sum of first n terms of the series 1/3 + 1/8 + 1/24 ... in which the denominators are one less than a perfect square that cannot otherwise be written as a power (cf. A062757, A037450).at n=15A062834
• Distinct values of A080374, where A080374(n) is the lcm of the first n consecutive prime differences.at n=10A080375
• Largest element of n-th row of A080738.at n=25A080742
• Numbers that can be expressed as the difference of the squares of primes in exactly sixteen distinct ways.at n=8A092012
• Smallest number having exactly n divisors d such that also d+2 is a divisor.at n=30A099476
• a(n) = denominator of sum{k=1 to n} 1/A127515(k).at n=15A127517
• Highly abundant numbers (A002093) that are not Harshad numbers (A005349).at n=14A128702
• If X_1,...,X_n is a partition of a 2n-set X into 2-blocks then a(n) is equal to the number of 4-subsets of X containing none of X_i, (i=1,...,n).at n=32A130810
• a(n) = the smallest positive integer with exactly n positive "non-isolated divisors". A divisor, k, of n is non-isolated if (k-1) or (k+1) also divides n.at n=34A133996
• Conjecturally, numbers j for which f(m) > f(j) for all m > j, where f(k) = H(k) + exp(H(k))*log(H(k)) - sigma(k).at n=34A176679
• Table (read by rows) of all k-digit positive integers (in ascending order) with maximum number of divisors A066150(k).at n=14A240544
• Largely composite numbers that are not highly composite.at n=62A244353
• Smallest number k such that the symmetric representation of sigma(k) has at least one part of width n.at n=25A250070
• Least k such that n+1 is the n-th divisor of k.at n=14A256605
• Triangle of coefficients c(n,i), 1<=i<=n, such that for each n>=2, c(n,i) are setwise coprime; and for all primes p>2n-1, the sum of (-1)^i*c(n,i)*binomial(i*p,p) is divisible by p^(2n-1).at n=50A268512
• 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=25A273379
• Highly composite numbers of class 2 (see comment in A275239).at n=39A275240
• Numbers k for which sigma(k) - 4k exceeds sigma(j) - 4j for all j < k.at n=18A279091