A278499 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A278499

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

5

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,2

COMMENTS

No subsequence 2, 3 will ever occur.

LINKS

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

FORMULA

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

PROG

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

CROSSREFS

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

Sequence in context: A286368 A190710 A114907 * A231132 A290327 A131732

Adjacent sequences: A278496 A278497 A278498 * A278500 A278501 A278502

KEYWORD

nonn

AUTHOR

Antti Karttunen, Nov 25 2016

STATUS

approved