login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A090239 a(n) = A053838(n) + 2 modulo 3. 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; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

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.

LINKS

Table of n, a(n) for n=0..104.

FORMULA

a(n)=mod(n+a([n/3]), 3), a(0)=2. - Michael Somos, Feb 14 2004

PROG

(PARI) a(n)=if(n<0, 0, 2*(n==0), (n+a(n\3))%3) /* Michael Somos, Feb 14 2004 */

CROSSREFS

Sequence in context: A124433 A287104 A190483 * A165276 A035698 A230204

Adjacent sequences:  A090236 A090237 A090238 * A090240 A090241 A090242

KEYWORD

nonn

AUTHOR

Philippe Deléham, Feb 04 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 26 09:52 EDT 2019. Contains 322472 sequences. (Running on oeis4.)