cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

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

Original entry on oeis.org

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

Views

Author

Matthew Vandermast, Nov 27 2010

Keywords

Comments

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.

Examples

			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.
		

Crossrefs

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.

Extensions

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

A181802 Triangle read by rows: T(n,k) is k-th smallest divisor of n that is highly composite (A002182).

Original entry on oeis.org

1, 1, 2, 1, 1, 2, 4, 1, 1, 2, 6, 1, 1, 2, 4, 1, 1, 2, 1, 1, 2, 4, 6, 12, 1, 1, 2, 1, 1, 2, 4, 1, 1, 2, 6, 1, 1, 2, 4, 1, 1, 2, 1, 1, 2, 4, 6, 12, 24, 1, 1, 2, 1, 1, 2, 4, 1, 1, 2, 6, 1, 1, 2, 4, 1, 1, 2, 1, 1, 2, 4, 6, 12, 36, 1, 1, 2, 1, 1, 2, 4, 1, 1, 2, 6, 1, 1, 2, 4, 1, 1, 2, 1, 1, 2, 4, 6, 12, 24, 48
Offset: 1

Views

Author

Matthew Vandermast, Nov 27 2010

Keywords

Comments

Row n contains A181801(n) numbers. T(n,k) * A180803(n, A181801(n)-k+1) = n.
Row n is identical to row (n+12) if n is not a multiple of 12.

Examples

			First rows read: 1; 1,2; 1; 1,2,4; 1; 1,2,6; 1; 1,2,4; 1; 1,2; 1; 1,2,4,6,12;...
8 has four divisors, of which three (1, 2 and 4) are members of A002182. Row 8 therefore reads 1, 2, 4.
		

Crossrefs

Formula

T(n,k) = n/(A180803(n, A181801(n)-k+1)).

A181805 Number of divisors of A181804(n) that are highly composite (A002182).

Original entry on oeis.org

1, 2, 3, 3, 5, 6, 6, 7, 6, 7, 8, 8, 8, 10, 11, 14, 9, 9, 12, 14, 19, 15, 20, 21, 21, 20, 15, 22, 22, 22, 21, 23, 22, 17, 23, 23, 23, 24, 25, 24, 25, 23, 23, 25, 28, 25, 27, 27, 31, 22, 27, 26, 30, 18, 29, 25, 32, 33, 28, 29, 28, 35, 25, 33, 34, 31, 31, 38, 37
Offset: 1

Views

Author

Matthew Vandermast, Nov 27 2010

Keywords

Comments

a(n) = maximal number of members of A002182 that have a least common multiple of A181804(n). Also, a(n) = length of row A181804(n) in triangles A181802 and A181803.
4, 13 and 16 are the first three positive integers that appear nowhere in this sequence (and, therefore, nowhere in A181801). It would be interesting to know whether there are others.

Examples

			A181804(10) = 72 has exactly seven divisors that are members of A002182 (namely, 1, 2, 4, 6, 12, 24 and 36). Hence, a(10) = 7.
		

Crossrefs

A181806(m) is the m-th member of A181804 such that the value of a(n) increases to a record. See also A181807.

Programs

Formula

a(n) = A181801(A181804(n)).

Extensions

More terms from Amiram Eldar, Jun 23 2023
Showing 1-3 of 3 results.