Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,1

FORMULA

a(n)=(1/4)*{-5*(n mod 4)+7*[(n+1) mod 4]-7*[(n+2) mod 4]+5*[(n+3) mod 4]}, with n>=0. - Paolo P. Lava (ppl(AT)spl.at), Nov 19 2007

CROSSREFS

Sequence in context: A122453 A017849 A134536 this_sequence A111880 A101497 A065870

Adjacent sequences: A131728 A131729 A131730 this_sequence A131732 A131733 A131734

KEYWORD

sign

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Sep 17 2007

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research