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 A023032 #23 Sep 08 2022 08:44:47
%S A023032 1,7,28,84,210,462,924,1715,3003,4998,8008,12348,18564,27048,38759,
%T A023032 54054,74613,100478,134596,176176,230202,294294,376740,471933,593775,
%U A023032 731276,905982,1099560,1344903,1610322,1947792,2306220,2759757,3235484,3838380
%N A023032 Number of compositions of n into 7 ordered relatively prime parts.
%H A023032 Marius A. Burtea, <a href="/A023032/b023032.txt">Table of n, a(n) for n = 7..5000</a>
%H A023032 N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>
%F A023032 Moebius transform of C(n-1,6).
%F A023032 G.f.: Sum_{k>=1} mu(k) * x^(7*k) / (1 - x^k)^7. - _Ilya Gutkovskiy_, Feb 05 2020
%p A023032 with(numtheory):
%p A023032 a:= n-> add(mobius(n/d)*binomial(d-1, 6), d=divisors(n)):
%p A023032 seq(a(n), n=7..50); # _Alois P. Heinz_, Feb 05 2020
%t A023032 a[n_]:=DivisorSum[n, Binomial[#-1, 6] MoebiusMu[n/#]&]; Array[a, 37, 7] (* or *) a[n_]:=Sum[Boole[Divisible[n, k]] MoebiusMu[n/k] Binomial[k-1, 6], {k, 1, n}]; Table[a[n], {n, 7, 45}] (* _Vincenzo Librandi_, Feb 07 2020 *)
%o A023032 (Magma) [&+[MoebiusMu(n div d)*Binomial(d-1,6):d in Divisors(n)]:n in[7..41]]; // _Marius A. Burtea_, Feb 07 2020
%Y A023032 Cf. A000741, A000742, A000743, A023031, A023033, A023034, A023035.
%K A023032 nonn
%O A023032 7,2
%A A023032 _David W. Wilson_