Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069188
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
2
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; listen)
OFFSET

1,2

FORMULA

a(n) = n*A000792(n - A001414(n)). - David Wasserman (wasserma(AT)spawar.navy.mil), 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

Cf. A000792, A001414.

Sequence in context: A039030 A162231 A132028 this_sequence A085158 A065639 A039090

Adjacent sequences: A069185 A069186 A069187 this_sequence A069189 A069190 A069191

KEYWORD

easy,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 24 2002

EXTENSIONS

Corrected and extended by David Wasserman (wasserma(AT)spawar.navy.mil), Apr 02 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research