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.

A179661 Triangle read by rows: T(n,k) is the largest least common multiple of any k-element subset of the first n positive integers.

Original entry on oeis.org

1, 2, 2, 3, 6, 6, 4, 12, 12, 12, 5, 20, 60, 60, 60, 6, 30, 60, 60, 60, 60, 7, 42, 210, 420, 420, 420, 420, 8, 56, 280, 840, 840, 840, 840, 840, 9, 72, 504, 2520, 2520, 2520, 2520, 2520, 2520, 10, 90, 630, 2520, 2520, 2520, 2520, 2520, 2520, 2520, 11, 110, 990
Offset: 1

Views

Author

Keywords

Comments

Sequence differs from A093919; first divergences are at indices 31, 40, 48, 59.
Main diagonal is A003418.

Examples

			Triangle begins:
    [ 1 ],
    [ 2, 2 ],
    [ 3, 6, 6 ],
    [ 4, 12, 12, 12 ],
    [ 5, 20, 60, 60, 60 ],
    [ 6, 30, 60, 60, 60, 60 ].
		

Crossrefs

Programs

Formula

T(n,k) = max{ lcm(x_1,...,x_k) ; 0 < x_1 < ... < x_k <= n }.