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