|
|
A271728
|
|
Numbers n such that A076478(n)=1.
|
|
1
|
|
|
1, 5, 6, 8, 9, 15, 17, 20, 21, 22, 25, 27, 28, 29, 31, 32, 33, 41, 44, 48, 49, 51, 55, 57, 59, 60, 63, 64, 65, 66, 70, 73, 74, 76, 78, 80, 81, 82, 83, 86, 87, 89, 90, 91, 92, 94, 95, 96, 97, 107, 111, 116, 117, 120, 125, 127, 130
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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
|
P. J. Cameron, The random graph, The Mathematics of Paul Erdos, 2nd ed., Algorithms Combin., 14 (1997), 333-351.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|