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 A341070 #5 Feb 04 2021 17:20:52
%S A341070 1,10,55,210,625,1552,3400,6840,12960,23330,40028,65740,104230,160670,
%T A341070 241640,354772,509620,718980,999645,1370720,1853903,2476250,3274110,
%U A341070 4289810,5568820,7162184,9138045,11579180,14574755,18215900,22619016,27929990,34311845,41921710,50946945
%N A341070 Number of ways to write n as an ordered sum of 10 squarefree numbers.
%F A341070 G.f.: (Sum_{k>=1} mu(k)^2 * x^k)^10.
%p A341070 b:= proc(n, t) option remember;
%p A341070 `if`(n=0, `if`(t=0, 1, 0), `if`(t<1, 0, add(
%p A341070 `if`(numtheory[issqrfree](j), b(n-j, t-1), 0), j=1..n)))
%p A341070 end:
%p A341070 a:= n-> b(n, 10):
%p A341070 seq(a(n), n=10..44); # _Alois P. Heinz_, Feb 04 2021
%t A341070 nmax = 44; CoefficientList[Series[Sum[MoebiusMu[k]^2 x^k, {k, 1, nmax}]^10, {x, 0, nmax}], x] // Drop[#, 10] &
%Y A341070 Cf. A005117, A008683, A008966, A098235, A280210, A326626, A341064, A341065, A341066, A341067, A341068, A341069.
%K A341070 nonn
%O A341070 10,2
%A A341070 _Ilya Gutkovskiy_, Feb 04 2021