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 A056286 #24 Aug 15 2024 03:35:27
%S A056286 0,0,0,0,0,120,2160,23940,211680,1643544,11748240,79419180,516257280,
%T A056286 3262443120,20193277104,123071707080,741419995680,4427490147480,
%U A056286 26264144909520,155018841055596,911509010154720,5344538384445120,31272099902089200,182707081122261480
%N A056286 Number of n-bead necklaces with exactly six different colored beads.
%C A056286 Turning over the necklace is not allowed.
%D A056286 M. R. Nester (1999). Mathematical investigations of some plant interaction designs. PhD Thesis. University of Queensland, Brisbane, Australia. [See A056391 for pdf file of Chap. 2]
%H A056286 Alois P. Heinz, <a href="/A056286/b056286.txt">Table of n, a(n) for n = 1..1000</a>
%F A056286 a(n) = A054625(n) - 6*A001869(n) + 15*A001868(n) - 20*A001867(n) + 15*A000031(n) - 6.
%F A056286 From _Robert A. Russell_, Sep 26 2018: (Start)
%F A056286 a(n) = (k!/n) Sum_{d|n} phi(d) S2(n/d,k), where k=6 is the number of colors and S2 is the Stirling subset number A008277.
%F A056286 G.f.: -Sum_{d>0} (phi(d)/d) * Sum_{j} (-1)^(k-j) * C(k,j) * log(1-j x^d), where k=6 is the number of colors. (End)
%e A056286 For n=6, the 120 necklaces are A followed by the 120 permutations of BCDEF.
%t A056286 k=6; Table[k!DivisorSum[n,EulerPhi[#]StirlingS2[n/#,k]&]/n,{n,1,30}] (* _Robert A. Russell_, Sep 26 2018 *)
%Y A056286 Cf. A000031, A001867, A001868, A001869, A054625.
%Y A056286 Column k=6 of A087854.
%K A056286 nonn
%O A056286 1,6
%A A056286 _Marks R. Nester_