id:A090239 - OEIS Search Results

Search: id:A090239

Displaying 1-1 of 1 results found.

page 1

a(n) = A053838(n) + 2 modulo 3.

+0
2

2, 0, 1, 0, 1, 2, 1, 2, 0, 0, 1, 2, 1, 2, 0, 2, 0, 1, 1, 2, 0, 2, 0, 1, 0, 1, 2, 0, 1, 2, 1, 2, 0, 2, 0, 1, 1, 2, 0, 2, 0, 1, 0, 1, 2, 2, 0, 1, 0, 1, 2, 1, 2, 0, 1, 2, 0, 2, 0, 1, 0, 1, 2, 2, 0, 1, 0, 1, 2, 1, 2, 0, 0, 1, 2, 1, 2, 0, 2, 0, 1, 0, 1, 2, 1, 2, 0, 2, 0, 1, 1, 2, 0, 2, 0, 1, 0, 1, 2, 2, 0, 1, 0, 1, 2 (list; graph; listen)

	OFFSET	`0,1`
	COMMENT	`Can construct sequence by starting with 2 and mapping 0->012, 1->120, 2->201 (e.g. 2, 201, 201012120, ...) and looking at n-th digit of a term with sufficient digits.`
	FORMULA	`a(n)=mod(n+a([n/3]), 3), a(0)=2. - Michael Somos Feb 14 2004`
	PROGRAM	`(PARI) a(n)=if(n<0, 0, 2*(n==0), (n+a(n\3))%3) - Michael Somos Feb 14 2004`
	CROSSREFS	`Sequence in context: A054528 A025884 A124433 this_sequence A035698 A071482 A071483` `Adjacent sequences: A090236 A090237 A090238 this_sequence A090240 A090241 A090242`
	KEYWORD	`nonn`
	AUTHOR	`DELEHAM Philippe (kolotoko(AT)wanadoo.fr), Feb 04 2004`

page 1

Search completed in 0.002 seconds

Last modified September 5 01:44 EDT 2008. Contains 143476 sequences.

AT&T Labs Research