A136253 -id:A136253 - cp's OEIS frontend

A181806 Positive integers with more highly composite divisors (A002182) than any smaller positive integer.

1, 2, 4, 12, 24, 48, 120, 240, 360, 720, 5040, 10080, 15120, 30240, 60480, 151200, 166320, 332640, 665280, 1663200, 1995840, 3326400, 8648640, 17297280, 21621600, 43243200, 86486400, 129729600, 259459200, 735134400

Offset: 1

Matthew Vandermast, Nov 27 2010

nonn

Numbers n such that A181801(n) > A181801(m) for all m < n. Also, numbers n such that row n of triangles A181802 and A181803 is longer than any previous row in either triangle.

Not a subsequence of A002182. The smallest positive integer which has a record number of highly composite divisors, but which is not highly composite itself, is 30240.

			12 has five divisors (namely, 1, 2, 4, 6 and 12) that are members of A002182. No positive integer smaller than 12 has more than three members of A002182 among its divisors; hence, 12 is a member of the sequence.

Charles R Greathouse IV, Table of n, a(n) for n = 1..153
A. Flammenkamp, List of the first 1200 highly composite numbers
Eric Weisstein's World of Mathematics, Highly composite number

A181807(n) = number of highly composite divisors of a(n) (i.e., A181801(a(n))).
Subsequence of A025487, A181804. Numbers A181804(n) such that A181805(n) increases to a record.
Includes all members of A136253.

a(20)-a(30) from Charles R Greathouse IV, Jan 14 2011

A212169 List of highly composite numbers (A002182) with an exponent in its prime factorization that is at least as great as the number of positive exponents; intersection of A002182 and A212165.

Original entry on oeis.org

1, 2, 4, 12, 24, 36, 48, 120, 240, 360, 720, 1680, 5040, 10080, 15120, 20160, 25200, 45360, 50400, 110880, 221760, 332640, 554400, 665280, 2882880, 8648640, 14414400, 17297280, 43243200, 294053760

Offset: 1

Matthew Vandermast, May 22 2012

Sequence can be used to find the largest highly composite number in subsequences of A212165 (of which there are several in the database).
Ramanujan showed that, in the canonical prime factorization of a highly composite number with largest prime factor prime(n), the largest exponent cannot exceed 2*log_2(prime(n+1)). (See formula 54 on page 15 of the Ramanujan paper.) This limit is less than n for all n >= 9 (and prime(n) >= 23).
1. Direct calculation verifies this for 9 <= n <= 11.
2. Nagura proved that, for any integer m >= 25, there is always a prime between m and 1.2*m.  Let n = 11, at which point prime(11) = 31 and log_2(prime(n+1)) = log 37/log 2 = 5.209453.... Since log 1.2/log 2 is only 0.263034..., it follows that n must increase by at least 3k before 2*log_2(prime(n+1)) can increase by 2k, for all values of k. Therefore, 2*log_2(prime(n+1)) can never catch up to prime(n) for n > 11.
665280 = 2^6*3^3*5*7*11 is the largest highly composite number whose prime factorization contains an exponent that is strictly greater than the number of positive exponents in that factorization (including the implied 1's).

			A002182(62) = 294053760 = 2^7*3^3*5*7*11*13*17 has 7 positive exponents in its prime factorization, including 5 implied 1's. The maximal exponent in its prime factorization is also 7. Therefore, 294053760 is a term of this sequence.

S. Ramanujan, Highly composite numbers, Proc. Lond. Math. Soc. 14 (1915), 347-409; reprinted in Collected Papers, Ed. G. H. Hardy et al., Cambridge 1927; Chelsea, NY, 1962.

A. Flammenkamp, List of the first 1200 highly composite numbers
J. Nagura, On the interval containing at least one prime number, Proc. Japan Acad., 28 (1952), 177-181.
S. Ramanujan, Highly Composite Numbers (p. 15) (pages 11-12 introduce some of the notation in formula 54)

A212165 also includes all terms in A006939, A066120, A087980, A130091, A138534, A141586, A166475, A181555, A181813-A181814, A181818, A181823-A181825, A182763.

Other finite subsequences of A002182 include A072938, A095921, A106037, A136253, A162935, A166981, A168263.

okQ[n_] := Module[{f = Transpose[FactorInteger[n]][[2]]}, Max[f] >= Length[f]]; a = 0; t = {}; Do[b = DivisorSigma[0, n]; If[b > a, a = b; If[okQ[n], AppendTo[t, n]]], {n, 10^6}]; t (* T. D. Noe, May 24 2012 *)

cp's OEIS Frontend

A181806 Positive integers with more highly composite divisors (A002182) than any smaller positive integer.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions