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 A000696 M4397 N1853 #25 Feb 02 2022 03:57:58 %S A000696 1,7,31,37,109,121,127,133,151,157,403,421,511,529,631,637,661,679, %T A000696 1579,1621,1633,1969,1981,2017,2041,2047,2053,2071,2077,2143,2149, %U A000696 2167,2173,2401,2527,2557,2677,6493,6559,6643,6661,6703,6733,6871 %N A000696 Numbers k such that (1,k) is "good". %C A000696 Let S be the set of nonnegative integers whose base-4 representation does not contain the digits 2 or 3. A pair (M,N) of nonnegative integers is called "good" if every nonnegative integer can be represented uniquely in the form M*s_1 - N*s_2 where s_1 and s_2 are in S. %D A000696 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence). %D A000696 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A000696 N. G. de Bruijn, <a href="http://dx.doi.org/10.1090/S0025-5718-1964-0167447-9">Some direct decompositions of the set of integers</a>, Math. Comp., 18 (1964), 537-546. %Y A000696 Cf. A000695. %K A000696 nonn,base %O A000696 1,2 %A A000696 _N. J. A. Sloane_ %E A000696 More terms from _Sean A. Irvine_, Feb 27 2011