A249603 A084937 mod 3.

1, 2, 0, 2, 1, 1, 0, 2, 2, 1, 0, 2, 1, 1, 0, 2, 1, 0, 2, 2, 1, 0, 1, 1, 2, 0, 1, 2, 0, 1, 2, 2, 0, 1, 2, 0, 2, 1, 0, 1, 2, 0, 2, 2, 1, 0, 1, 2, 0, 2, 1, 0, 1, 2, 1, 0, 2, 1, 0, 2, 2, 0, 1, 1, 1, 0, 1, 1, 0, 2, 2, 0, 2, 2, 0, 1, 1, 0, 2, 2, 0, 1, 1, 0, 2, 2, 1

Offset

1,2

Comments

By definition of A084937 this cannot contain two consecutive 0's. So the 0's divide this sequence into runs of 1's and 2's. In the first 100000 terms the following runs of 1's and 2's appear: 11, 12, 21, 22, 111, 112, 121, 122, 211, 212, 221, 222, 1112, 1121, 1122, 1212, 1221, 2111, 2112, 2121, 2211, 2212, 2221. There is no obvious structure. - N. J. A. Sloane, Nov 07 2014

Links

Reinhard Zumkeller, Table of n, a(n) for n = 1..100000

Prog

(Haskell)
a249603 = flip mod 3 . a084937  -- Reinhard Zumkeller, Nov 04 2014

Crossrefs

Cf. A084937.

Sequence in context: A001822 A351380 A346730 * A231714 A366445 A354578

Adjacent sequences: A249600 A249601 A249602 * A249604 A249605 A249606

Keyword

nonn

Author

N. J. A. Sloane, Nov 03 2014

Status

approved