A278499 a(n) = A276573(n) modulo 4.

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

Offset: 0

Author

Antti Karttunen, Nov 25 2016

Keywords

• nonn

Comments

No subsequence 2, 3 will ever occur.

Links

• Antti Karttunen, Table of n, a(n) for n = 0..10028

Crossrefs

Cf. A002828, A010873, A276573, A276575, A278497, A278498.

Programs

Scheme

(define (A278499 n) (modulo (A276573 n) 4))

Formula

a(n) = A010873(A276573(n)) = A276573(n) modulo 4.