|
| |
|
|
A211110
|
|
Number of partitions of n into divisors > 1 of n.
|
|
10
|
|
|
|
0, 1, 1, 2, 1, 3, 1, 4, 2, 3, 1, 12, 1, 3, 3, 10, 1, 15, 1, 16, 3, 3, 1, 80, 2, 3, 5, 20, 1, 94, 1, 36, 3, 3, 3, 280, 1, 3, 3, 158, 1, 154, 1, 28, 25, 3, 1, 1076, 2, 29, 3, 32, 1, 255, 3, 262, 3, 3, 1, 7026, 1, 3, 32, 202, 3, 321, 1, 40, 3, 302, 1, 12072, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,4
|
|
|
COMMENTS
|
a(A000040(n)) = 1; a(A002808(n)) > 1;
a(A001248(n)) = 2; a(A080257(n)) > 2;
a(A006881(n)) = 3; a(A033942(n)) > 3.
|
|
|
LINKS
|
Table of n, a(n) for n=1..73.
|
|
|
EXAMPLE
|
a(10) = #{10, 5+5, 2+2+2+2+2} = 3;
a(11) = #{11} = 1;
a(12) = #{12, 6+6, 6+4+2, 6+3+3, 6+2+2+2, 4+4+4, 4+4+2+2, 4+3+3+2, 4+2+2+2+2, 3+3+3+3, 3+3+2+2+2, 6x2} = 12;
a(13) = #{13} = 1;
a(14) = #{14, 7+7, 2+2+2+2+2+2+2} = 3;
a(15) = #{15, 5+5+5, 3+3+3+3+3} = 3.
|
|
|
PROG
|
(Haskell)
a211110 n = p (tail $ a027750_row n) n where
p _ 0 = 1
p [] _ = 0
p ks'@(k:ks) m | m < k = 0
| otherwise = p ks' (m - k) + p ks m
|
|
|
CROSSREFS
|
Cf. A211111, A018818, A027750.
Cf. A210442.
Sequence in context: A074206 A173801 A108466 * A200780 A087145 A194943
Adjacent sequences: A211107 A211108 A211109 * A211111 A211112 A211113
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Reinhard Zumkeller, Apr 01 2012
|
|
|
STATUS
|
approved
|
| |
|
|
