cp's OEIS Frontend

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.

A341068 Number of ways to write n as an ordered sum of 8 squarefree numbers.

This page as a plain text file.
%I A341068 #6 Feb 04 2021 17:29:19
%S A341068 1,8,36,112,274,568,1072,1912,3263,5280,8128,12048,17474,24824,34428,
%T A341068 46600,62163,82160,107452,138392,176116,222560,279756,348168,428954,
%U A341068 524848,639976,775448,932376,1113808,1326748,1573656,1855767,2175728,2544048,2965280,3441568,3974744,4580060
%N A341068 Number of ways to write n as an ordered sum of 8 squarefree numbers.
%F A341068 G.f.: (Sum_{k>=1} mu(k)^2 * x^k)^8.
%p A341068 b:= proc(n, t) option remember;
%p A341068       `if`(n=0, `if`(t=0, 1, 0), `if`(t<1, 0, add(
%p A341068       `if`(numtheory[issqrfree](j), b(n-j, t-1), 0), j=1..n)))
%p A341068     end:
%p A341068 a:= n-> b(n, 8):
%p A341068 seq(a(n), n=8..46);  # _Alois P. Heinz_, Feb 04 2021
%t A341068 nmax = 46; CoefficientList[Series[Sum[MoebiusMu[k]^2 x^k, {k, 1, nmax}]^8, {x, 0, nmax}], x] // Drop[#, 8] &
%Y A341068 Cf. A005117, A008683, A008966, A098235, A280210, A326443, A341064, A341065, A341066, A341067, A341069, A341070.
%K A341068 nonn
%O A341068 8,2
%A A341068 _Ilya Gutkovskiy_, Feb 04 2021