login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A131389
Sequence (d(n)) generated by Rule 1 (see Comments) with a(1) = 1 and d(1) = 0.
21
0, 1, 2, -1, 3, 4, -2, -3, 6, -4, 5, 7, -5, 8, -6, -7, 9, 10, -8, 11, -10, 12, -9, -11, 13, 14, -13, -12, 15, 16, -14, -15, 17, 18, -16, 19, -17, 20, -19, 21, -18, 22, -20, -21, 24, -22, 23, 25, -23, 26, -25, 27, -24, 28, -26, -27, 30, 29, -31, 32, -28, 31, -29, 33, -30, 34, -32, -33, 35, 36, -34
OFFSET
1,3
COMMENTS
Rule 1 is given at A131388. Conjecture: Every integer occurs exactly once in A131389.
LINKS
FORMULA
This is the sequence d( ) in the formula for A131388.
EXAMPLE
See A131388.
MATHEMATICA
See A131388.
KEYWORD
sign
AUTHOR
Clark Kimberling, Jul 05 2007
EXTENSIONS
Definition clarified by Clark Kimberling, May 12 2015
STATUS
approved