login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A102565 A102563(n)-A102564(n). 0
0, 0, 1, -2, 1, -2, -1, 0, 1, -2, -1, 0, -1, 0, 1, -2, 1, -2, -1, 0, -1, 0, 1, -2, -1, 0, 1, -2, 1, -2, -1, 0, 1, -2, -1, 0, -1, 0, 1, -2, -1, 0, 1, -2, 1, -2, -1, 0, -1, 0, 1, -2, 1, -2, -1, 0, 1, -2, -1, 0, -1, 0, 1, -2, 1, -2, -1, 0, -1, 0, 1, -2, -1, 0, 1, -2, 1, -2, -1, 0, -1, 0, 1, -2, 1, -2, -1, 0, 1, -2, -1, 0, -1, 0, 1, -2, -1, 0, 1, -2, 1 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

COMMENTS

It would appear that a(2n+1)=(-2)*A010060(n); a(4n+1)=(-2)*A010060(n); a(8n+1)=(-2)*A010060(n); a(2^n)=0^n-1; a(2^n+1)=3*0^n-2; a(2^(n+1)-1)=-(1-(-1)^n).

CROSSREFS

Cf. A076826.

Sequence in context: A107016 A066057 A060588 * A076826 A137178 A101666

Adjacent sequences:  A102562 A102563 A102564 * A102566 A102567 A102568

KEYWORD

easy,sign

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Jan 14 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 17:11 EST 2012. Contains 205938 sequences.