Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134667
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134667 Period 6: repeat 0, 1, 0, 0, 0, -1. +0
2
0, 1, 0, 0, 0, -1, 0, 1, 0, 0, 0, -1, 0, 1, 0, 0, 0, -1, 0, 1, 0, 0, 0, -1, 0, 1, 0, 0, 0, -1, 0, 1, 0, 0, 0, -1, 0, 1, 0, 0, 0, -1, 0, 1, 0, 0, 0, -1, 0, 1, 0, 0, 0, -1, 0, 1, 0, 0, 0, -1, 0, 1, 0, 0, 0, -1, 0, 1, 0, 0, 0, -1, 0, 1, 0, 0, 0, -1, 0, 1, 0, 0, 0, -1, 0, 1, 0, 0, 0, -1, 0, 1, 0, 0, 0, -1, 0, 1, 0, 0, 0, -1, 0, 1, 0 (list; graph; listen)
OFFSET

0,1

FORMULA

a(n)=(1/6)*{-(n mod 6)+[(n+1) mod 6]+[(n+4) mod 6]-[(n+5) mod 6]}, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jan 28 2008

Euler transform of length 6 sequence [ 0, 0, 0, -1, 0, 1]. - Michael Somos Feb 10 2008

a(-n) = -a(n).

G.f.: x * (1 - x^4) / (1 - x^6) = (x + x^3) / (1 + x^2 + x^4).

EXAMPLE

x - x^5 + x^7 - x^11 + x^13 - x^17 + x^19 - x^23 + x^25 - x^29 + ...

PROGRAM

(PARI) {a(n) = [0, 1, 0, 0, 0, -1][n%6+1]} /* Michael Somos Feb 10 2008 */

(PARI) {a(n) = kronecker(-12, n)} /* Michael Somos Feb 10 2008 */

CROSSREFS

Cf. A120325, A131719, A131720, A131735, A131736.

Adjacent sequences: A134664 A134665 A134666 this_sequence A134668 A134669 A134670

Sequence in context: A071038 A109017 A110161 this_sequence A117943 A096268 A079101

KEYWORD

sign,easy

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Jan 26 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified January 8 02:43 EST 2009. Contains 152824 sequences.


AT&T Labs Research