Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A065252
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A065252 The sequence A065251 reduced modulo 3 (i.e. replace every -1 with 2). +0
2
1, 1, 0, 1, 0, 2, 1, 1, 0, 2, 1, 0, 2, 1, 0, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2 (list; graph; listen)
OFFSET

1,6

FORMULA

a(0)=0, a(2n) = 2 - a(n), a(2n+1) = 2 - (a(n)+1 mod 3).

MAPLE

[seq((A065251(j) mod 3), j=1..120)];

CROSSREFS

Adjacent sequences: A065249 A065250 A065251 this_sequence A065253 A065254 A065255

Sequence in context: A035183 A054522 A110250 this_sequence A115211 A060826 A078134

KEYWORD

nonn

AUTHOR

Antti Karttunen Oct 25 2001

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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research