Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,1

FORMULA

a(n)=(-1)^(n+1)+9 a(n)=10*(n mod 2)+8*[(n+1) mod 2] - Paolo P. Lava (ppl(AT)spl.at), Oct 20 2006

CROSSREFS

Sequence in context: A124685 A105021 A088487 this_sequence A066004 A107032 A043624

Adjacent sequences: A010730 A010731 A010732 this_sequence A010734 A010735 A010736

KEYWORD

nonn

AUTHOR

njas

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research