OFFSET
1,4
LINKS
Giovanni Resta, Table of n, a(n) for n = 1..100
EXAMPLE
There are two pairs of partitions of 6 that give the same product: the partitions {1,1,2,2} and {1,1,4} have product 4 and the partitions {2,2,2} and {2,4} have product 8. You can't find three different partitions of 6 that give the same product. Hence a(6) = 2.
MATHEMATICA
Table[Max[Transpose[Tally[Times @@@ IntegerPartitions[n]]][[2]]], {n, 60}]
PROG
(Haskell)
import Data.List (sort, group)
a140436 n = a140436_list !! (n-1)
a140436_list = map (maximum . map length . group . sort . map product) $
tail pss where
pss = [] : map p [1..]
p u = [u] : [v : ps | v <- [1..u], ps <- pss !! (u - v), v <= head ps]
-- Reinhard Zumkeller, Oct 10 2013
CROSSREFS
KEYWORD
nice,nonn
AUTHOR
Tanya Khovanova, Jun 20 2008
STATUS
approved