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 A357123 #16 Oct 15 2022 08:10:16
%S A357123 1,1,2,2,5,5,2,1,11,8,1,1,26,16,2,1,65,39,7,5,284,183,52,31,8,3,422,
%T A357123 243,58,31,4,2,893,475,144,79,21,11,1,1,428,233,54,29,3,2,2034,1180,
%U A357123 371,213
%N A357123 Number of sets S of size A066063(n) such that {1, 2, ..., n} is a subset of S + S.
%C A357123 A066063(n) is the size of the smallest set S such that S+S contains {1,2,...,n}.
%H A357123 William Chang, <a href="/A357123/a357123.py.txt">Python script</a>
%e A357123 For n=3 we can generate {1, 2, 3} with S = {0, 1, 2} and S = {0, 1, 3}.
%Y A357123 Cf. A066063.
%K A357123 nonn,more
%O A357123 1,3
%A A357123 _William Chang_, Sep 12 2022
%E A357123 a(31)-a(50) from _Giovanni Resta_, Oct 15 2022