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”).

A338241
For any m >= 0, a(3*m) = 3*a(m), a(3*m+1) = 1-3*a(m), a(3*m+2) = 3*a(m)-1.
3
0, 1, -1, 3, -2, 2, -3, 4, -4, 9, -8, 8, -6, 7, -7, 6, -5, 5, -9, 10, -10, 12, -11, 11, -12, 13, -13, 27, -26, 26, -24, 25, -25, 24, -23, 23, -18, 19, -19, 21, -20, 20, -21, 22, -22, 18, -17, 17, -15, 16, -16, 15, -14, 14, -27, 28, -28, 30, -29, 29, -30, 31
OFFSET
0,4
COMMENTS
This sequence is a variant of A117966.
This sequence is a bijection from N = [0..+oo) to Z = (-oo..+oo).
FORMULA
Sum_{k = 0..n} a(k) >= 0 with equality iff n belongs to A005823.
EXAMPLE
For n = 0:
- a(3*0) = 3*a(0),
- so a(0) = 0.
For n = 1:
- a(1) = 1 - 3*a(0) = 1.
For n = 2:
- a(2) = 3*a(0) - 1 = -1.
For n = 4:
- a(4) = 1 - 3*a(1) = -2.
PROG
(PARI) a(n) = { if (n==0, return (0), my (d=n%3, m=n\3); if (d==0, 3*a(m), d==1, 1-3*a(m), 3*a(m)-1)) }
CROSSREFS
Cf. A005823, A117966, A338242-A338243 (bisections).
Sequence in context: A129001 A029246 A316995 * A222456 A222673 A222666
KEYWORD
sign
AUTHOR
Rémy Sigrist, Oct 18 2020
STATUS
approved