login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 1
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = n*A000792(n - A001414(n)). - David Wasserman, Apr 02 2003
EXAMPLE
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
Sequence in context: A285724 A193551 A277439 * A085158 A065639 A325829
KEYWORD
easy,nonn
AUTHOR
Amarnath Murthy, Mar 24 2002
EXTENSIONS
Corrected and extended by David Wasserman, Apr 02 2003
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 3 19:56 EDT 2024. Contains 372222 sequences. (Running on oeis4.)