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 A326178 #5 Jun 14 2019 21:52:00
%S A326178 0,1,2,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,
%T A326178 27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,
%U A326178 50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67
%N A326178 Number of subsets of {1..n} whose product is equal to their sum.
%C A326178 Same as A001477 (the nonnegative integers) with 3 removed.
%e A326178 The a(1) = 1 through a(9) = 10 subsets:
%e A326178 {1} {1} {1} {1} {1} {1} {1} {1} {1}
%e A326178 {2} {2} {2} {2} {2} {2} {2} {2}
%e A326178 {3} {3} {3} {3} {3} {3} {3}
%e A326178 {1,2,3} {4} {4} {4} {4} {4} {4}
%e A326178 {1,2,3} {5} {5} {5} {5} {5}
%e A326178 {1,2,3} {6} {6} {6} {6}
%e A326178 {1,2,3} {7} {7} {7}
%e A326178 {1,2,3} {8} {8}
%e A326178 {1,2,3} {9}
%e A326178 {1,2,3}
%t A326178 Table[Length[Select[Subsets[Range[n]],Times@@#==Plus@@#&]],{n,0,10}]
%Y A326178 Cf. A053632, A057567, A057568, A063865, A301987, A326156, A326158, A326179, A326180.
%K A326178 nonn,dumb
%O A326178 0,3
%A A326178 _Gus Wiseman_, Jun 13 2019