Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A137797
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A137797 a(n) = 2*[(n+1) mod 5] - 2*[(n+1) mod 2] +0
2
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; listen)
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: A010660 A067736 A091671 this_sequence A140874 A021227 A040013

Adjacent sequences: A137794 A137795 A137796 this_sequence A137798 A137799 A137800

KEYWORD

easy,sign

AUTHOR

William A. Tedeschi (fynmun(AT)hotmail.com), Feb 10 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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 20 09:10 EDT 2010. Contains 173642 sequences.


AT&T Labs Research