|
|
A355748
|
|
Number of ways to choose a sequence of divisors, one of each part of the n-th composition in standard order.
|
|
5
|
|
|
1, 1, 2, 1, 2, 2, 2, 1, 3, 2, 4, 2, 2, 2, 2, 1, 2, 3, 4, 2, 4, 4, 4, 2, 3, 2, 4, 2, 2, 2, 2, 1, 4, 2, 6, 3, 4, 4, 4, 2, 6, 4, 8, 4, 4, 4, 4, 2, 2, 3, 4, 2, 4, 4, 4, 2, 3, 2, 4, 2, 2, 2, 2, 1, 2, 4, 4, 2, 6, 6, 6, 3, 6, 4, 8, 4, 4, 4, 4, 2, 4, 6, 8, 4, 8, 8, 8
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
The k-th composition in standard order (graded reverse-lexicographic, A066099) is obtained by taking the set of positions of 1's in the reversed binary expansion of k, prepending 0, taking first differences, and reversing again. This gives a bijective correspondence between nonnegative integers and integer compositions.
|
|
LINKS
|
|
|
EXAMPLE
|
Composition number 152 in standard order is (3,1,4), and the a(152) = 6 choices are: (1,1,1), (1,1,2), (1,1,4), (3,1,1), (3,1,2), (3,1,4).
|
|
MATHEMATICA
|
stc[n_]:=Differences[Prepend[Join@@Position[Reverse[IntegerDigits[n, 2]], 1], 0]]//Reverse;
Table[Times@@Length/@Divisors/@stc[n], {n, 0, 100}]
|
|
CROSSREFS
|
Positions of 1's are A000079 (after the first).
An unordered version (using prime indices) is A355731:
A003963 multiplies together the prime indices of n.
A005811 counts runs in binary expansion.
A066099 lists the compositions in standard order.
A353851 counts compositions with all equal run-sums, ranked by A353848.
A353852 ranks compositions with all distinct run-sums, counted by A353850.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|