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

A071622
a(n) = (-1)*Sum_{k=1..n} (-1)^floor((4/3)^k).
1
1, 2, 1, 2, 1, 2, 3, 4, 5, 6, 7, 8, 7, 6, 5, 6, 7, 8, 7, 8, 7, 6, 7, 6, 5, 6, 5, 6, 7, 8, 7, 6, 7, 8, 7, 6, 5, 6, 7, 8, 9, 10, 11, 12, 11, 10, 9, 10, 11, 10, 9, 8, 7, 8, 7, 8, 7, 8, 9, 10, 9, 8, 9, 8, 9, 8, 7, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 14, 15, 14, 13, 12, 13, 12, 13, 12, 11, 10, 9, 10, 9
OFFSET
1,2
COMMENTS
Conjecture: for n>2300, a(n) > log(n)^2.
PROG
(PARI) for(n=1, 100, print1(-sum(i=1, n, sign((-1)^floor((4/3)^i))), ", "))
CROSSREFS
Cf. A071532.
Sequence in context: A139803 A058746 A080916 * A182063 A135990 A347256
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, Jun 22 2002
STATUS
approved