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 A286330 #4 May 07 2017 21:37:49
%S A286330 1,1,2,3,3,5,7,10,11,15,19,26,32,42,50,66,78,101,118,150,178,224,263,
%T A286330 327,382,471,551,670,781,944,1098,1317,1526,1821,2105,2498,2879,3399,
%U A286330 3908,4592,5266,6164,7056,8220,9388,10897,12424,14368,16342,18843,21394,24585,27858,31932,36119,41277
%N A286330 Number of partitions of n into a squarefree number of squarefree parts.
%H A286330 <a href="/index/Par#part">Index entries for related partition-counting sequences</a>
%e A286330 a(8) = 11 because we have [7, 1], [6, 2], [6, 1, 1], [5, 3], [5, 2, 1], [3, 3, 2], [3, 2, 1, 1, 1], [3, 1, 1, 1, 1, 1], [2, 2, 2, 1, 1], [2, 2, 1, 1, 1, 1] and [2, 1, 1, 1, 1, 1, 1].
%t A286330 Join[{1}, Table[Length[Select[IntegerPartitions[n], SquareFreeQ[Length[#]] && AllTrue[#, SquareFreeQ] &]], {n, 55}]]
%Y A286330 Cf. A005117, A073576, A085755, A286141.
%K A286330 nonn
%O A286330 0,3
%A A286330 _Ilya Gutkovskiy_, May 07 2017