login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Conjecture: for n>2300, a(n) > log(n)^2.
LINKS
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)