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 A332470 #20 Sep 08 2022 08:46:25
%S A332470 1,1,5,16,69,226,923,3312,12825,47896,184755,700712,2704155,10373455,
%T A332470 40113421,154946976,601080389,2332498482,9075135299,35338355380,
%U A332470 137846298360,538213522254,2104098963719,8233142596640,32247603662625,126408753954731,495918514791900
%N A332470 a(n) = Sum_{d|n} mu(n/d) * binomial(n+d-2, n-1).
%H A332470 Seiichi Manyama, <a href="/A332470/b332470.txt">Table of n, a(n) for n = 1..1000</a>
%F A332470 a(n) = [x^n] Sum_{k>=1} mu(k) * x^k / (1 - x^k)^n.
%F A332470 a(n) = |{(x_1, x_2, ... , x_{n-1}) : 1 <= x_1 <= x_2 <= ... <= x_n = n, gcd(x_1, x_2, ... , x_n) = 1}|. - _Seiichi Manyama_, Apr 20 2021
%t A332470 Table[DivisorSum[n, MoebiusMu[n/#] Binomial[n + # - 2, n - 1] &], {n, 1, 27}]
%t A332470 Table[SeriesCoefficient[Sum[MoebiusMu[k] x^k/(1 - x^k)^n, {k, 1, n}], {x, 0, n}], {n, 1, 27}]
%o A332470 (Magma) [&+[MoebiusMu(n div d) *Binomial(n+d-2,n-1):d in Divisors(n)]:n in [1..30]]; // _Marius A. Burtea_, Feb 13 2020
%o A332470 (PARI) a(n) = sumdiv(n, d, moebius(n/d)*binomial(n+d-2, n-1)); \\ _Michel Marcus_, Feb 14 2020
%Y A332470 Cf. A000010, A007438, A008683, A117108, A117109, A332508, A343547.
%K A332470 nonn
%O A332470 1,3
%A A332470 _Ilya Gutkovskiy_, Feb 13 2020