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 A316893 #8 Jul 16 2018 21:47:30
%S A316893 1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,2,0,0,0,0,0,1,3,1,2,1,1,1,
%T A316893 2,1,5,3,1,1,5,2,9,3,3,3,4,2,6,6,3,4,9,5,10,4,10,8,15,10,21,12,14,16,
%U A316893 18,9,30,18,17,16,28,16,29,25,26,30,28,33,48,31
%N A316893 Number of aperiodic integer partitions of n into relatively prime parts whose reciprocal sum is 1.
%C A316893 The reciprocal sum of (y_1, ..., y_k) is 1/y_1 + ... + 1/y_k.
%C A316893 A partition is aperiodic if its multiplicities are relatively prime.
%H A316893 Gus Wiseman, <a href="/A051908/a051908.txt">Sequences counting and ranking integer partitions by their reciprocal sums</a>
%t A316893 Table[Length[Select[IntegerPartitions[n],And[GCD@@#==1,GCD@@Length/@Split[#]==1,Sum[1/m,{m,#}]==1]&]],{n,30}]
%Y A316893 Cf. A000837, A002966, A051908, A058360, A100953, A316854, A316888-A316904.
%K A316893 nonn
%O A316893 1,22
%A A316893 _Gus Wiseman_, Jul 16 2018
%E A316893 a(71)-a(80) from _Giovanni Resta_, Jul 16 2018