The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A211111 Number of partitions of n into distinct divisors > 1 of n. 8
 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 6, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 3, 1, 2, 1, 1, 1, 19, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 16, 1, 1, 1, 1, 1, 2, 1, 4, 1, 1, 1, 14, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,12 COMMENTS a(A136446(n)) > 1. LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..1000 EXAMPLE n=12: the divisors > 1 of 12 are {2,3,4,6,12}, there are exactly two subsets which sum up to 12, namely {12} and {2,4,6}, therefore a(12) = 2; a(13) = #{13} = 1, because 13 is prime, having no other divisor > 1; n=14: the divisors > 1 of 14 are {2,7,14}, {14} is the only subset summing up to 14, therefore a(14) = 1. PROG (Haskell) a211111 n = p (tail \$ a027750_row n) n where    p _  0 = 1    p [] _ = 0    p (k:ks) m | m < k     = 0                | otherwise = p ks (m - k) + p ks m CROSSREFS Cf. A211110, A033630, A027750. Cf. A065205. Sequence in context: A305936 A339790 A334924 * A074971 A344008 A198067 Adjacent sequences:  A211108 A211109 A211110 * A211112 A211113 A211114 KEYWORD nonn AUTHOR Reinhard Zumkeller, Apr 01 2012 STATUS approved

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

Last modified July 25 03:32 EDT 2021. Contains 346282 sequences. (Running on oeis4.)