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 A321347 #28 Dec 21 2020 17:12:44
%S A321347 1,1,0,0,0,0,1,1,0,0,1,1,1,1,1,2,2,1,2,2,2,4,4,2,3,4,4,5,6,5,6,7,7,9,
%T A321347 10,10,13,12,11,15,17,16,19,20,20,25,28,26,30,33,35,41,43,42,50,55,57,
%U A321347 64,67,67,79,86,87,97,105,109,124,131,135,151,163,169
%N A321347 Number of strict integer partitions of n containing no prime powers (including 1).
%C A321347 First differs from A286221 at a(30) = 6, A286221(30) = 5.
%H A321347 Fausto A. C. Cariboni, <a href="/A321347/b321347.txt">Table of n, a(n) for n = 0..500</a>
%e A321347 The a(36) = 13 strict integer partitions:
%e A321347 (36),
%e A321347 (21,15), (22,14), (24,12), (26,10), (30,6), (35,1),
%e A321347 (14,12,10), (18,12,6), (20,10,6), (20,15,1), (21,14,1),
%e A321347 (15,14,6,1).
%t A321347 nn=100;
%t A321347 ser=Product[If[PrimePowerQ[n],1,1+x^n],{n,nn}];
%t A321347 CoefficientList[Series[ser,{x,0,nn}],x]
%Y A321347 Cf. A000607, A000961, A001597, A002095, A023893, A023894, A096258, A246655, A320322, A321346, A321378, A321665, A322452, A322454.
%K A321347 nonn
%O A321347 0,16
%A A321347 _Gus Wiseman_, Dec 11 2018