Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,6

FORMULA

a(n)=(1/6)*{(n mod 6)-2*[(n+1) mod 6]-[(n+2) mod 6]+2*[(n+5) 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) . a(n) = [A119910(n+3)-A049347(n+1)]/2 for n>0. O.g.f.: -(2*x^3+x-1)/[(x^2-x+1)(x^2+x+1)]. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 31 2008

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

CROSSREFS

Cf. A000079, A135575.

Sequence in context: A033264 A080234 A136049 this_sequence A025924 A025904 A137993

Adjacent sequences: A135691 A135692 A135693 this_sequence A135695 A135696 A135697

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 August 28 22:44 EDT 2008. Contains 143251 sequences.


AT&T Labs Research