|
|
A242900
|
|
Number of compositions of n into exactly two different parts with distinct multiplicities.
|
|
5
|
|
|
3, 10, 12, 38, 56, 79, 152, 251, 284, 594, 920, 1108, 2136, 3402, 4407, 8350, 12863, 17328, 33218, 52527, 70074, 133247, 214551, 294299, 547360, 883572, 1234509, 2284840, 3667144, 5219161, 9551081, 15386201, 22079741, 40061664, 64666975, 93985744, 168363731
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
4,1
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(4) = 3: [2,1,1], [1,2,1], [1,1,2].
a(5) = 10: [2,1,1,1], [1,2,1,1], [1,1,2,1], [1,1,1,2], [2,2,1], [2,1,2], [1,2,2], [3,1,1], [1,3,1], [1,1,3].
|
|
MAPLE
|
with(numtheory):
a:= n-> add(add(add(`if`(d<p and (n-p*m)/d<>m, binomial((n-p*m)
/d+m, m), 0), d=divisors(n-p*m)), m=1..n/p), p=2..n-1):
seq(a(n), n=4..60);
|
|
MATHEMATICA
|
div[0] = {}; div[n_] := Divisors[n]; a[n_] := Sum[Sum[Sum[If[d<p && (n-p*m)/d != m, Binomial[(n-p*m)/d+m, m], 0], {d, div[n-p*m]}], {m, 1, n/p}], {p, 2, n-1}]; Table[ a[n], {n, 4, 60}] (* Jean-François Alcover, Feb 11 2015, after Alois P. Heinz *)
|
|
CROSSREFS
|
Cf. A182473 (the same for partitions), A131661 (multiplicities may be equal).
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|