Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006996
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006996 C(2n,n) mod 3.
(Formerly M0021)
+0
7
1, 2, 0, 2, 1, 0, 0, 0, 0, 2, 1, 0, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 1, 0, 1, 2, 0, 0, 0, 0, 1, 2, 0, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 1, 0, 1, 2, 0, 0, 0, 0, 1, 2, 0, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; listen)
OFFSET

0,2

COMMENT

Removing 0's from the sequence gives Thue-Morse sequence A001285 : 1,2,0,2,1,0,0,0,0,2,1,0,1,2,..->1,2,2,1,2,1,1,2,... - Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 04 2004

a(n) = 0 if n in A074940, a(n) = 1 if n in A074939, a(n) = 2 if n in A074938.

LINKS

Michael Gilleland, Some Self-Similar Integer Sequences

FORMULA

a(n)=A005704(n) mod 3. - Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 04 2004

A fixed point of the morphism : 1 -> 120, 2 -> 210, 0 -> 000 . - DELEHAM Philippe (kolotoko(AT)wanadoo.fr), Jan 08 2004

MATHEMATICA

Table[ Mod[ Binomial[2n, n], 3], {n, 0, 104}] (* Or *)

Nest[ Function[ l, {Flatten[(l /. {0 -> {0, 0, 0}, 1 -> {1, 2, 0}, 2 -> {2, 1, 0}})]}], {1}, 7] (from Robert G. Wilson v 28 2005)

CROSSREFS

Sequence in context: A056615 A060989 A135298 this_sequence A112604 A072627 A069848

Adjacent sequences: A006993 A006994 A006995 this_sequence A006997 A006998 A006999

KEYWORD

nonn

AUTHOR

njas, Jim Propp (propp(AT)math.wisc.edu)

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