

A046185


A B2sequence due to Rachel Lewis.


2



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
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,2


COMMENTS

"The first 68 elements of the sequence are [given], then the greedy algorithm is used." For this B2sequence: "The reciprocal sum is at least 2.16086," greater than that of the MianChowla sequence (A005282), which is at most 2.158533.  Danny Rorabaugh (with quotes by Rachel Lewis), Sep 29 2015


REFERENCES

S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 163166.


LINKS

Danny Rorabaugh, Table of n, a(n) for n = 0..848
S. R. Finch, Erdos's Reciprocal Sum Constants [broken link]
S. R. Finch, MianChowla and B2 sequences
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

Cf. A005282.
Sequence in context: A026039 A004978 A005282 * A259964 A218913 A241691
Adjacent sequences: A046182 A046183 A046184 * A046186 A046187 A046188


KEYWORD

nonn


AUTHOR

Eric W. Weisstein


EXTENSIONS

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


STATUS

approved



