A090193 a(n) = A053838(n) + 1 modulo 3.

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, 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, 2, 0, 1, 0, 1, 2, 1, 2, 0, 0, 1, 2, 1, 2, 0, 2, 0, 1, 1, 2, 0, 2, 0, 1

Offset: 0

Author

Philippe Deléham, Feb 04 2004

Keywords

• base
• nonn

Comments

Can construct sequence by starting with 1 and mapping 0->012, 1->120, 2->201 (e.g. 1, 120, 120201012, ...) and looking at n-th digit of a term with sufficient digits.

Links

• Vincenzo Librandi, Table of n, a(n) for n = 0..2000

Programs

Mathematica

Mod[ Nest[ Join[ #, # + 1, # + 2] &, {1}, 5], 3] (* Robert G. Wilson v, Jul 27 2014 *)