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.

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)).