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.

A069188 Look at all numbers formed by multiplying the parts in a partition of n; a(n) = maximal such number which is divisible by n.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 16, 27, 30, 11, 72, 13, 84, 180, 288, 17, 648, 19, 1080, 1134, 594, 23, 5832, 6075, 1404, 19683, 13608, 29, 43740, 31, 93312, 32076, 8262, 153090, 472392, 37, 18468, 170586, 1574640, 41, 2480058, 43, 1732104, 10628820, 100602, 47
Offset: 1

Views

Author

Amarnath Murthy, Mar 24 2002

Keywords

Examples

			a(10) = 30 obtained as the product of parts of partition (5,3,2) of 10 (though the maximum product obtained is 36 as 2*2*3*3).
		

Crossrefs

Formula

a(n) = n*A000792(n - A001414(n)). - David Wasserman, Apr 02 2003

Extensions

Corrected and extended by David Wasserman, Apr 02 2003