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 A356747 #8 Aug 26 2022 07:30:06
%S A356747 1,2,141,1035,2388,3973,5157,14160,37023,68861,99889,116106,117939,
%T A356747 627400,1561944,1626983,5901444,10054091,12260525,32619981,49775099
%N A356747 Numbers m that divide A306070(m) = Sum_{k=1..m} bphi(k), where bphi is the bi-unitary totient function (A116550).
%C A356747 The corresponding quotients A306070(m)/m are 1, 1, 57, 418, ... (see the link for more values).
%C A356747 a(22) > 6.5*10^8, if it exists.
%H A356747 Amiram Eldar, <a href="/A356747/a356747.txt">Table of n, a(n), A306070(a(n))/a(n) for n = 1..21</a>.
%t A356747 phi[x_, n_] := DivisorSum[n, MoebiusMu[#]*Floor[x/#] &]; bphi[n_] := DivisorSum[n, (-1)^PrimeNu[#]*phi[n/#, #] &, CoprimeQ[#, n/#] &]; seq = {}; s = 0; Do[s = s + bphi[n]; If[Divisible[s, n], AppendTo[seq, n]], {n, 1, 10^6}]; seq
%Y A356747 Cf. A116550, A306070.
%Y A356747 Similar sequences: A048290, A306950.
%K A356747 nonn,more
%O A356747 1,2
%A A356747 _Amiram Eldar_, Aug 25 2022