login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A325555
Number of necklace compositions of n with distinct differences up to sign.
3
1, 2, 2, 4, 5, 6, 10, 15, 19, 24, 39, 49, 78, 106, 155, 207, 313, 430, 608, 867, 1239, 1670, 2313, 3220, 4483
OFFSET
1,2
COMMENTS
A necklace composition of n is a finite sequence of positive integers summing to n that is lexicographically minimal among all of its cyclic rotations.
The differences of a sequence are defined as if the sequence were increasing, so for example the differences of (3,1,2) are (-2,1).
EXAMPLE
The a(1) = 1 through a(8) = 15 necklace compositions:
(1) (2) (3) (4) (5) (6) (7) (8)
(11) (12) (13) (14) (15) (16) (17)
(22) (23) (24) (25) (26)
(112) (113) (33) (34) (35)
(122) (114) (115) (44)
(132) (124) (116)
(133) (125)
(142) (134)
(223) (143)
(1132) (152)
(224)
(233)
(1124)
(1142)
(1322)
MATHEMATICA
neckQ[q_]:=Array[OrderedQ[{q, RotateRight[q, #]}]&, Length[q]-1, 1, And];
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n], UnsameQ@@Abs[Differences[#]]&&neckQ[#]&]], {n, 15}]
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, May 11 2019
STATUS
approved