| 0, 1, 2, 3, 4, 6, 7, 8, 9, 11, 12, 13, 14, 16, 17, 18, 19, 21, 22, 23, 24, 25, 26, 27, 29, 30, 31, 32, 34, 35, 36, 37, 39, 40, 41, 42, 44, 45, 46, 47, 48, 49, 50, 52, 53, 54, 55, 57, 58, 59, 60, 62, 63, 64, 65
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
(s,t)-sequences; the case s=3, t=2.
|
|
REFERENCES
|
Clark Kimberling, Complementary Equations, Journal of Integer Sequences, Vol. 10 (2007), Article 07.1.4.
|
|
LINKS
|
A. S. Fraenkel, Heap games, numeration systems and sequences
Index entries for sequences related to Beatty sequences
|
|
FORMULA
|
a(n)=mex {a(i), b(i):0 <= i<n}, where b=A045775, mex S=least integer \ge 0 not in the sequence S
|
|
CROSSREFS
|
Cf. A045749, A045750.
Sequence in context: A039258 A039199 A115180 this_sequence A045681 A001961 A020656
Adjacent sequences: A045771 A045772 A045773 this_sequence A045775 A045776 A045777
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Aviezri S. Fraenkel (fraenkel(AT)wisdom.weizmann.ac.il)
|
|
