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!)
A071532 (-1) * Sum[ k =1,n, (-1)^floor((3/2)^k) ]. 4
1, 0, 1, 2, 3, 4, 5, 6, 5, 6, 5, 6, 5, 6, 7, 6, 7, 8, 7, 8, 9, 10, 9, 8, 9, 8, 9, 8, 7, 8, 7, 8, 9, 10, 11, 10, 9, 10, 9, 8, 7, 8, 7, 6, 7, 8, 7, 8, 7, 6, 5, 6, 7, 6, 7, 6, 7, 8, 9, 8, 9, 10, 11, 12, 13, 12, 11, 10, 11, 10, 11, 10, 9, 10, 9, 10, 9, 8, 7, 6, 5, 6, 7, 6, 7, 6, 5, 4, 5, 6, 5, 4, 5, 4, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
Let b(n) denote the number of k with 0<=k<=n such that floor((3/2)^k) = A002379(k) is even; then a(n) = n-2*b(n).
Equivalently: let c(n) denote the number of k, 0<=k<=n, such that floor((3/2)^k) = A002379(k) is odd, then a(n) = 2*c(n)-n.
Is a(n)>0? For n large enough does a(n)>sqrt(n) always hold?
Conjecture: asymptotically, a(n) ~ C * Log(n)^2 with C = 1.4.....
LINKS
Robert G. Wilson v, Graph of first 100000 terms
FORMULA
a(n) = (-1)*sum( i=1, n, (-1)^A002379 (i) )
MATHEMATICA
a[0] = 0; a[n_] := a[n] = a[n - 1] - (-1)^Floor[(3/2)^n]; Table[ a[n], {n, 0, 95}]
PROG
(PARI) a(n)=-sum(i=1, n, sign((-1)^floor((3/2)^i)))
(PARI) a(n)=n-2*sum(k=0, n, if(floor((3/2)^k)%2, 0, 1))
CROSSREFS
Cf. A072418.
Sequence in context: A017861 A094700 A073635 * A102730 A165597 A269757
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, Jun 20 2002
EXTENSIONS
Edited by Ralf Stephan, Sep 01 2004
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 25 09:16 EDT 2024. Contains 371967 sequences. (Running on oeis4.)