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.

A181803 Triangle read by rows: T(n,k) is the k-th smallest divisor d of n such that n sets a record for the number of its divisors that are multiples of d.

Original entry on oeis.org

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

Views

Author

Matthew Vandermast, Nov 27 2010

Keywords

Comments

In other words, row n contains a particular divisor d of n iff more multiples of d appear among the divisors of n than appear among the divisors of any smaller positive integer. Cf. A181808.
Row n contains A181801(n) numbers, the largest of which is n. T(n,k) * A180802(n, A181801(n)-k+1) = n.
For all positive integer values (j,k) such that jk = n, the number of divisors of n that are multiples of j equals A000005(k). Therefore, j appears in row n iff k=n/j is a member of A002182.

Examples

			First rows read: 1; 1,2; 3; 1,2,4; 5; 1,3,6; 7; 2,4,8; 9; 5,10; 11; 1,2,3,6,12;...
6 has four divisors (1, 2, 3 and 6). Of those divisors, 1, 3 and 6 appear in row 6.
a. The divisors of 6 include four multiples of 1 (1, 2, 3 and 6); two multiples of 3 (3 and 6), and one multiple of 6 (6). No positive integer smaller than 6 has more than three multiples of 1 among its divisors; hence, 1 appears in row 6. Also, no positive integer smaller than 6 has more than one multiple of 3 among its divisors, or has any multiple of 6 among its divisors. Hence, 3 and 6 both appear in row 6.
b. On the other hand, although 6 includes two multiples of 2 among its divisors (2 and 6), so does a smaller positive integer (4, whose even divisors are 2 and 4). Accordingly, 2 is not included in row 6.
The divisors of 6 that appear in row 6 are therefore 1, 3 and 6. Note that 1, 3 and 6 equal 6/6, 6/2 and 6/1 respectively, and all of the denominators in those fractions are highly composite numbers (A002182).
		

Crossrefs

For the highly composite divisors of n, see A181802. See also A181808, A181809, A181810.

Formula

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

A181808 Numbers that set a record for number of even divisors: a(n) = 2*A002182(n).

Original entry on oeis.org

2, 4, 8, 12, 24, 48, 72, 96, 120, 240, 360, 480, 720, 1440, 1680, 2520, 3360, 5040, 10080, 15120, 20160, 30240, 40320, 50400, 55440, 90720, 100800, 110880, 166320, 221760, 332640, 443520, 554400, 665280, 997920, 1108800, 1330560, 1441440, 2162160, 2882880, 4324320
Offset: 1

Views

Author

Matthew Vandermast, Nov 27 2010

Keywords

Comments

In other words, a positive integer n appears in the sequence iff more even numbers divide n than divide any positive integer smaller than n.
For all positive integer values (j,k) such that jk = n, the number of divisors of n that are multiples of j equals A000005(k). Therefore, n sets a record for the number of its divisors that are multiples of j iff k=n/j is highly composite (A002182). Cf. A181803, A181809, A181810.

Examples

			a(4)=12 has exactly four even divisors (2, 4, 6 and 12).  (Note that these are precisely the numbers that are twice a divisor of A002182(4)=6; see row 6 of A027750.)  No positive integer smaller than 12 has as many as four even divisors; hence, 12 is a member of the sequence.
		

Crossrefs

Numbers n such that 2 appears in row n of A181803. See also A181809, A181810.
A002183(n) gives number of even divisors of a(n).
A053624 gives numbers that set records for number of odd divisors. No number sets records both for its number of odd divisors and its number of even divisors.

Formula

a(n)=2*A002182(n).

A181809 Numbers n such that both n and n/2 are highly composite (A002182).

Original entry on oeis.org

2, 4, 12, 24, 48, 120, 240, 360, 720, 1680, 2520, 5040, 10080, 15120, 20160, 50400, 55440, 110880, 166320, 221760, 332640, 554400, 665280, 1441440, 2162160, 2882880, 4324320, 7207200, 8648640, 14414400, 17297280, 21621600, 43243200, 73513440
Offset: 1

Views

Author

Matthew Vandermast, Nov 27 2010

Keywords

Comments

These are the numbers that set records both for total number of divisors and for number of even divisors; intersection of A002182 and A181808.
For all positive integer values (j,k) such that jk = n, the number of divisors of n that are multiples of j equals A000005(k). Therefore, n sets a record for the number of its divisors that are multiples of j iff k=n/j is highly composite (A002182).

Examples

			The number 12 is both highly composite (A002182(5) = 12) and twice another highly composite number (12 = 2*6 = 2*A002182(4)).  It therefore has more divisors (A002183(5)=6) than any smaller positive integer, and more even divisors (A002183(4)=4) than any smaller positive integer. Since 12 is the third positive integer with the properties that define this sequence, a(3)=12.
		

Crossrefs

Numbers n such that 1 and 2 both appear in row n of A181803. See also A181808, A181810.
A053624 gives numbers that set records for number of odd divisors. No number sets records both for its number of odd divisors and its number of even divisors. Only the number 1 sets a record for its number of odd divisors and its number of total divisors.
Subsequence of A025487.
Showing 1-3 of 3 results.