A046185 A B2-sequence due to Rachel Lewis.

1, 2, 4, 8, 13, 21, 31, 45, 66, 81, 97, 123, 148, 182, 204, 252, 291, 324, 352, 415, 486, 540, 651, 706, 781, 864, 963, 1003, 1148, 1217, 1371, 1409, 1523, 1673, 1974, 2105, 2191, 2317, 2496, 2652, 2726, 2858, 3219, 3268, 3500, 3605, 3864, 3962, 4237

Offset: 0

Author

Eric W. Weisstein

Keywords

• nonn

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

Crossrefs

Cf. A005282.

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

Extensions

a(34) corrected by Steven Finch in email with Danny Rorabaugh, Sep 29 2015