cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A318731 Number of relatively prime Lyndon compositions (aperiodic necklaces of positive integers) with sum n.

This page as a plain text file.
%I A318731 #4 Sep 02 2018 17:09:02
%S A318731 1,0,1,2,5,7,17,27,54,93,185,324,629,1143,2175,4050,7709,14469,27593,
%T A318731 52276,99839,190371,364721,698508,1342170,2580165,4970952,9585232,
%U A318731 18512789,35787985,69273665,134211600,260300799,505278705,981706783
%N A318731 Number of relatively prime Lyndon compositions (aperiodic necklaces of positive integers) with sum n.
%F A318731 Moebius transform of A059966. Second Moebius transform of A008965.
%e A318731 The a(6) = 7 relatively prime Lyndon compositions are 15, 114, 132, 123, 1113, 1122, 11112.
%e A318731 The a(7) = 17 relatively prime Lyndon compositions:
%e A318731   16, 25, 34,
%e A318731   115, 142, 124, 133, 223,
%e A318731   1114, 1213, 1132, 1123, 1222,
%e A318731   11113, 11212, 11122,
%e A318731   111112.
%t A318731 LyndonQ[q_]:=Array[OrderedQ[{q,RotateRight[q,#]}]&,Length[q]-1,1,And]&&Array[RotateRight[q,#]&,Length[q],1,UnsameQ];
%t A318731 Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],LyndonQ[#]&&GCD@@#==1&]],{n,10}]
%Y A318731 Cf. A000740, A000837, A008965, A059966, A100953, A296302.
%K A318731 nonn
%O A318731 1,4
%A A318731 _Gus Wiseman_, Sep 02 2018