Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,3

FORMULA

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

a(n)=a(n-6) = -a(n-2)-a(n-4) . O.g.f.: -(x+1)*(3*x^2+1)/[(x^2-x+1)(x^2+x+1)]. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 31 2008

CROSSREFS

Cf. A105899.

Adjacent sequences: A135692 A135693 A135694 this_sequence A135696 A135697 A135698

Sequence in context: A143797 A079729 A071859 this_sequence A105899 A071434 A128924

KEYWORD

sign,easy,more

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Feb 24 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 October 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research