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 A365519 #35 Jan 20 2024 03:54:47
%S A365519 1,1,1,2,2,1,3,4,3,2,13,4,6,3,8,8,8,9,21,8,24,13,11,16,10,6,9,12,62,8,
%T A365519 33,16,24,24,24,36,18,63,24,32,42,24,21,48,24,33,69,64,21,10,32,24,26,
%U A365519 27,144,48,40,62,61,32,62,99,72,32,48,24,33,96,88,24
%N A365519 Moebius inversion of A015134.
%F A365519 a(n) = Sum_{d|n} moebius(d)*A015134(n/d).
%F A365519 A015134(n) = Sum_{d|n} a(d).
%e A365519 For n=4, the a(4) = 2 cycles counted are
%e A365519 {0 1 1 2 3 1} repeating
%e A365519 {0 3 3 2 1 3} repeating
%e A365519 There are 2 other cycles {0} and {0 2 2} mod 4 which are not counted because they are multiples of cycles counted at earlier n (n=1 for {0} and n=2 for {0 1 1}*2 = {0 2 2}).
%t A365519 a[n_]:=Sum[MoebiusMu[d]Part[ResourceFunction["OEISSequence"]["A015134"],n/d],{d,Divisors[n]}]; Array[a,70] (* _Stefano Spezia_, Sep 27 2023 *)
%Y A365519 Cf. A008683, A015134.
%K A365519 nonn
%O A365519 1,4
%A A365519 _Jay Anderson_, Sep 07 2023