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!)
A089045 a(n) = a(n-1) + (-1)^floor(n/2)*a(floor(n/2)) with a(1) = 1. 1
1, 0, -1, -1, -1, 0, 1, 0, -1, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 1, 1, 0, -1, 0, 1, 0, -1, -1, -1, 0, 1, 0, -1, 0, 1, 1, 1, 0, -1, 0, 1, 0, -1, -1, -1, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 0, -1, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 1, 1, 0, -1, 0, 1, 0, -1, -1, -1, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 0, -1, 0, 1, 1, 1, 0, -1, 0, 1, 0, -1, -1, -1, 0, 1, 0, -1, 0, 1, 1, 1, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
abs(a(n)) = A035263(n).
PROG
(PARI) lista(nn) = {my(v=vector(nn)); v[1]=1; for(n=2, nn, v[n] = v[n-1] + (-1)^floor(n/2)*v[floor(n/2)]); v; } \\ Jinyuan Wang, Feb 27 2020
CROSSREFS
Sequence in context: A141260 A029883 A035263 * A259599 A070749 A285341
KEYWORD
sign
AUTHOR
Benoit Cloitre, Dec 02 2003
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 July 8 06:06 EDT 2024. Contains 374149 sequences. (Running on oeis4.)