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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A137797 a(n) = 2*[(n+1) mod 5] - 2*[(n+1) mod 2] 1
0, 4, 4, 8, -2, 2, 2, 6, 6, 0, 0, 4, 4, 8, -2, 2, 2, 6, 6, 0, 0, 4, 4, 8, -2, 2, 2, 6, 6, 0, 0, 4, 4, 8, -2, 2, 2, 6, 6, 0, 0, 4, 4, 8, -2, 2, 2, 6, 6, 0, 0, 4, 4, 8, -2, 2, 2, 6, 6, 0, 0, 4, 4, 8, -2, 2, 2, 6, 6, 0, 0, 4, 4, 8, -2, 2, 2, 6, 6 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

EXAMPLE

a(2) = 2*[(2+1) mod 5] - 2*[(2+1) mod 2] = 2*[3 mod 5] - 2*[3 mod 2] = 4

CROSSREFS

Suggested by A010700. Used in A137798.

Sequence in context: A067736 A181387 A091671 * A176295 A140874 A021227

Adjacent sequences:  A137794 A137795 A137796 * A137798 A137799 A137800

KEYWORD

easy,sign

AUTHOR

William A. Tedeschi (fynmun(AT)hotmail.com), Feb 10 2008

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 15 07:05 EST 2012. Contains 205694 sequences.