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 A054628 #31 Feb 16 2025 08:32:42
%S A054628 1,9,45,249,1665,11817,88725,683289,5381685,43046889,348684381,
%T A054628 2852823609,23535840225,195528140649,1634056945605,13726075481049,
%U A054628 115813764494505,981010688215689,8338590871415805,71097458824894329,607883273127192897
%N A054628 Number of n-bead necklaces with 9 colors.
%H A054628 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Necklace.html">Necklace.</a>
%H A054628 <a href="/index/Ne#necklaces">Index entries for sequences related to necklaces</a>
%F A054628 a(n) = (1/n)*Sum_{d|n} phi(d)*9^(n/d), n > 0.
%F A054628 G.f.: 1 - Sum_{n>=1} phi(n)*log(1 - 9*x^n)/n. - _Herbert Kociemba_, Nov 02 2016 [corrected by _Ilya Gutkovskiy_, Apr 17 2021]
%F A054628 a(0) = 1; a(n) = (1/n) * Sum_{k=1..n} 9^gcd(n,k). - _Ilya Gutkovskiy_, Apr 17 2021
%e A054628 G.f. = 1 + 9*x + 45*x^2 + 249*x^3 + 1665*x^4 + 11817*x^5 + 88725*x^6 + ...
%p A054628 with(combstruct):A:=[N,{N=Cycle(Union(Z$9))},unlabeled]: seq(count(A,size=n),n=0..20); # _Zerinvary Lajos_, Dec 05 2007
%t A054628 mx=40; CoefficientList[Series[1-Sum[EulerPhi[i] Log[1-9*x^i]/i, {i, 1, mx}], {x, 0, mx}], x] (* _Herbert Kociemba_, Nov 02 2016 *)
%t A054628 k=9; Prepend[Table[DivisorSum[n, EulerPhi[#] k^(n/#) &]/n, {n, 1, 30}], 1] (* _Robert A. Russell_, Sep 21 2018 *)
%o A054628 (PARI) a(n)=if(n==0, 1, 1/n*sumdiv(n, d, eulerphi(d)*9^(n/d))); \\ _Altug Alkan_, Sep 21 2018
%Y A054628 Column 9 of A075195.
%Y A054628 Cf. A054616.
%K A054628 nonn
%O A054628 0,2
%A A054628 _N. J. A. Sloane_, Apr 16 2000
%E A054628 Edited by _Christian G. Bower_, Sep 07 2002
%E A054628 a(0) corrected by _Herbert Kociemba_, Nov 02 2016