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.
%I A091696 #49 Feb 10 2025 05:44:06
%S A091696 1,2,3,5,7,12,17,29,45,77,125,223,379,686,1223,2249,4111,7684,14309,
%T A091696 27011,50963,96908,184409,352697,675187,1296857,2493725,4806077,
%U A091696 9272779,17920859,34669601,67159049,130216123,252745367,490984487,954637557,1857545299
%N A091696 Number of classes of compositions of n equivalent under reflection or cycling.
%C A091696 Equivalently, the number of radial cutting patterns of a (maximally symmetric) circular cake such that all resulting pieces are a multiple of 1/n of the whole. - _Peter Munn_, Oct 27 2020
%H A091696 Alois P. Heinz, <a href="/A091696/b091696.txt">Table of n, a(n) for n = 1..1000</a>
%F A091696 a(n) = A000029(n) - 1.
%F A091696 a(n) = A056342(n) + 1.
%F A091696 G.f.: ( Sum_{n>=1} phi(n)*log(2+1/(-1+x^n))/n + (1-1x^2+x^3)/((x-1)*(1-2*x^2)) )/(-2). - _Herbert Kociemba_, Dec 04 2016
%e A091696 7 has 15 partitions and 64 compositions. Compositions can be mapped to other compositions by reflection, cycling, or both, e.g., {1,2,4} -> {4,2,1} (reflection), {2,4,1} (cycling), or {1,4,2} (both); this defines the equivalence relation used. The number of equivalence classes so defined is 2 greater than the number of partitions because only {3,1,2,1} and {2,1,2,1,1} (and their equivalents) cannot be mapped to the conventionally stated forms of partitions (here, {3,2,1,1} and {2,2,1,1,1} respectively). So a(7) = 15 + 2 = 17.
%p A091696 with(numtheory):
%p A091696 a:= n-> add(phi(d)*2^(n/d)/(2*n), d=divisors(n))
%p A091696 +`if`(irem(n, 2)=0, 2^(n/2-1) +2^(n/2-2), 2^((n-1)/2)) -1:
%p A091696 seq(a(n), n=1..40); # _Alois P. Heinz_, Oct 20 2012
%t A091696 Needs["Combinatorica`"]
%t A091696 nn=40;Apply[Plus,Table[CoefficientList[Series[CycleIndex[DihedralGroup[n], s]/.Table[s[i]->x^i/(1-x^i),{i,1,nn}],{x,0,nn}],x],{n,1,nn}]] (* _Geoffrey Critzer_, Oct 18 2012 *)
%t A091696 mx:=50;CoefficientList[Series[(Sum[(EulerPhi[n] Log[2+1/(-1+x^n)])/n,{n,1,mx}]+(1-1x^2+ x^3)/((x-1) (1-2 x^2)))/(-2),{x,0,mx}],x] (* _Herbert Kociemba_, Dec 04 2016 *)
%t A091696 a[n_] := (1/4)*(Mod[n, 2] + 3)*2^Quotient[n, 2] + DivisorSum[n, EulerPhi[#]*2^(n/#) & ]/(2*n) - 1; Array[a, 37] (* _Jean-François Alcover_, Nov 05 2017 *)
%Y A091696 Cf. A000029, A056342.
%Y A091696 DIK transform of A057427.
%K A091696 nonn
%O A091696 1,2
%A A091696 _Neil Fernandez_, Jan 29 2004
%E A091696 More terms from _Sean A. Irvine_, Feb 09 2012