OFFSET
1,2
COMMENTS
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.
LINKS
Gabriel Conant, Table of n, a(n) for n = 1..3000
P. J. Cameron, The random graph, The Mathematics of Paul Erdos, 2nd ed., Algorithms Combin., 14 (1997), 333-351.
CROSSREFS
KEYWORD
nonn
AUTHOR
Gabriel Conant, Apr 13 2016
STATUS
approved