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 A300586 #4 Mar 09 2018 21:16:00
%S A300586 1,0,0,0,0,1,0,1,1,1,1,2,1,4,2,2,4,6,2,8,4,6,6,15,4,11,10,12,8,30,3,
%T A300586 38,24,17,24,23,14,70,36,37,23,102,8,122,49,39,80,177,38,136,54,113,
%U A300586 101,297,60,152,102,192,226,485,28,571,312,200,390,338,84,908,393,507,104,1229,241,1421
%N A300586 Number of partitions of n into distinct squarefree parts that do not divide n.
%H A300586 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%e A300586 a(14) = 2 because we have [11, 3] and [6, 5, 3].
%t A300586 Table[SeriesCoefficient[Product[(1 + Boole[Mod[n, k] != 0 && SquareFreeQ[k]] x^k), {k, 1, n}], {x, 0, n}], {n, 0, 73}]
%Y A300586 Cf. A005117, A087188, A200745, A209402, A225245, A300584, A300585.
%K A300586 nonn
%O A300586 0,12
%A A300586 _Ilya Gutkovskiy_, Mar 09 2018