OFFSET
0,2
COMMENTS
"The first 68 elements of the sequence are [given], then the greedy algorithm is used." For this B2-sequence: "The reciprocal sum is at least 2.16086," greater than that of the Mian-Chowla sequence (A005282), which is at most 2.158533. - Danny Rorabaugh (with quotes by Rachel Lewis), Sep 29 2015
REFERENCES
Steven R. Finch, Mathematical Constants, Cambridge, 2003, pp. 163-166, with section 2.20.2, Mian-Chowla and B2-Sequences
LINKS
Danny Rorabaugh, Table of n, a(n) for n = 0..848
Steven R. Finch, Erdos's Reciprocal Sum Constants [Broken link]
Steven R. Finch, Erdos's Reciprocal Sum Constants [From the Wayback machine]
Rachel Lewis, Mian-Chowla and B2 sequences, 1999. [Thanks to Steven Finch for providing this document. Included with permission. - N. J. A. Sloane, Jan 02 2020]
Eric Weisstein's World of Mathematics, B2 Sequence
FORMULA
For n>67, a(n) is the least number such that all pairwise differences of distinct elements of {a(0), ..., a(n)} are distinct. - Danny Rorabaugh, Sep 29 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
a(34) corrected by Steven Finch in email with Danny Rorabaugh, Sep 29 2015
STATUS
approved