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

A094114
a(n) = -Sum_{i=1..n-1} (-1)^i*2^valuation(i,3).
1
0, 1, 0, 2, 1, 2, 0, 1, 0, 4, 3, 4, 2, 3, 2, 4, 3, 4, 0, 1, 0, 2, 1, 2, 0, 1, 0, 8, 7, 8, 6, 7, 6, 8, 7, 8, 4, 5, 4, 6, 5, 6, 4, 5, 4, 8, 7, 8, 6, 7, 6, 8, 7, 8, 0, 1, 0, 2, 1, 2, 0, 1, 0, 4, 3, 4, 2, 3, 2, 4, 3, 4, 0, 1, 0, 2, 1, 2, 0, 1, 0, 16, 15, 16, 14, 15, 14, 16, 15, 16, 12, 13, 12, 14, 13, 14, 12
OFFSET
1,4
LINKS
Robert Ferréol (MathCurve), Cantor's (ternary) set [in French]
MAPLE
a:= n-> -add((-1)^i*2^padic[ordp](i, 3), i=1..n-1):
seq(a(n), n=1..100); # Alois P. Heinz, Jan 05 2021
MATHEMATICA
a[n_] := Sum[(-1)^(i+1) * 2^IntegerExponent[i, 3], {i, 1, n-1}]; Array[a, 100] (* Amiram Eldar, Jun 17 2022 *)
PROG
(PARI) a(n)=-sum(i=1, n-1, (-1)^i*2^valuation(i, 3))
CROSSREFS
Sequence in context: A213890 A226460 A358360 * A104607 A368734 A120728
KEYWORD
nonn
AUTHOR
Benoit Cloitre, May 03 2004
STATUS
approved