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 A271728 #25 Apr 14 2016 11:23:13 %S A271728 1,5,6,8,9,15,17,20,21,22,25,27,28,29,31,32,33,41,44,48,49,51,55,57, %T A271728 59,60,63,64,65,66,70,73,74,76,78,80,81,82,83,86,87,89,90,91,92,94,95, %U A271728 96,97,107,111,116,117,120,125,127,130 %N A271728 Numbers n such that A076478(n)=1. %C A271728 By definition, this sequence enumerates a 'universal' set S of nonnegative integers: meaning that every finite binary sequence occurs as a consecutive subsequence of the characteristic function of S (viewed as an infinite binary sequence). The infinite graph with vertex set the integers and edge relation '|x-y| in S' is a countable random graph. %H A271728 Gabriel Conant, <a href="/A271728/b271728.txt">Table of n, a(n) for n = 1..3000</a> %H A271728 P. J. Cameron, <a href="http://dx.doi.org/10.1007/978-1-4614-7254-4_22">The random graph</a>, The Mathematics of Paul Erdos, 2nd ed., Algorithms Combin., 14 (1997), 333-351. %Y A271728 Cf. A076478. %K A271728 nonn %O A271728 1,2 %A A271728 _Gabriel Conant_, Apr 13 2016