|
|
A271654
|
|
a(n) = Sum_{k|n} binomial(n-1,k-1).
|
|
9
|
|
|
1, 2, 2, 5, 2, 17, 2, 44, 30, 137, 2, 695, 2, 1731, 1094, 6907, 2, 30653, 2, 97244, 38952, 352739, 2, 1632933, 10628, 5200327, 1562602, 20357264, 2, 87716708, 2, 303174298, 64512738, 1166803145, 1391282, 4978661179, 2, 17672631939, 2707475853, 69150651910, 2, 286754260229, 2, 1053966829029, 115133177854, 4116715363847, 2, 16892899722499, 12271514, 63207357886437
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Also the number of compositions of n whose length divides n, i.e., compositions with integer mean, ranked by A096199. - Gus Wiseman, Sep 28 2022
|
|
LINKS
|
|
|
EXAMPLE
|
The a(1) = 1 through a(6) = 17 compositions with integer mean:
(1) (2) (3) (4) (5) (6)
(1,1) (1,1,1) (1,3) (1,1,1,1,1) (1,5)
(2,2) (2,4)
(3,1) (3,3)
(1,1,1,1) (4,2)
(5,1)
(1,1,4)
(1,2,3)
(1,3,2)
(1,4,1)
(2,1,3)
(2,2,2)
(2,3,1)
(3,1,2)
(3,2,1)
(4,1,1)
(1,1,1,1,1,1)
(End)
|
|
MAPLE
|
a:= n-> add(binomial(n-1, d-1), d=numtheory[divisors](n)):
|
|
MATHEMATICA
|
Table[Length[Join @@ Permutations/@Select[IntegerPartitions[n], IntegerQ[Mean[#]]&]], {n, 15}] (* Gus Wiseman, Sep 28 2022 *)
|
|
PROG
|
(PARI) a(n)=sumdiv(n, k, binomial(n-1, k-1))
|
|
CROSSREFS
|
These compositions are ranked by A096199.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|