997920

Appears in sequences

• Largest number having binary order n (A029837) and of which the number of divisors is maximal in that range of g(k) = n.at n=20A036493
• Expansion of e.g.f. x^4*exp(x)^2 - 2*x^4*exp(x) + x^4.at n=11A052793
• Sixth (unsigned) column sequence of triangle A062139 (generalized a=2 Laguerre).at n=4A062195
• The n-digit number whose divisors have the maximal sum (A066410).at n=5A066424
• Numbers k such that gcd(sigma(k),k) = k/5.at n=20A067237
• Largest n-digit number with maximal number of divisors.at n=5A069650
• Triangle read by rows: T(n,k) is the number of labeled 2-connected planar graphs with n nodes and k edges, n >= 3, n <= k <= 3(n-2).at n=37A100960
• Triangle read by rows: the k-th entry of row n is the number of particular connectivity requirements that a k-linked graph with n >= 2k vertices has to satisfy T(n,k) = (1/2) * n!/(k!*(n-2*k)!) where k runs from 1 to floor(n/2).at n=34A135610
• a(n) = number of elements of order n in simple group Alt(11) of order 19958400.at n=19A145822
• Numbers that set a record for number of even divisors: a(n) = 2*A002182(n).at n=34A181808
• Triangular array read by rows: T(n,k) is the number of set partitions of {1,2,...,n} that have exactly k distinct block sizes.at n=31A208437
• Numbers k for which sigma(k)/k - 2/5 is an integer.at n=6A218407
• Table (read by rows) of all k-digit positive integers (in ascending order) with maximum number of divisors A066150(k).at n=16A240544
• Largely composite numbers that are not highly composite.at n=64A244353
• Numbers n such that tau(n)*sigma(n) divides n^2.at n=4A245787
• Larger of pairs (m, n), such that the difference of their squares is a cube and the difference of their cubes is a square.at n=14A261328
• Highly composite numbers of class 4 (see comment in A275239).at n=35A275242
• Least number k such that the number of its divisors is n times the number of its prime factors, counted with multiplicity.at n=18A275819
• E.g.f.: Product_{m>0} (1 + x^(2*m-1) + x^(4*m-2)/2! + x^(6*m-3)/3!).at n=9A293489
• Numbers k such that k divides lcm(tau(k), sigma(k)).at n=24A307740