A290108 a(n) = A268819(n) mod 8.

0, 1, 3, 0, 6, 2, 2, 1, 4, 7, 6, 3, 1, 3, 1, 0, 0, 5, 0, 6, 0, 7, 3, 2, 0, 0, 7, 2, 6, 0, 2, 1, 0, 1, 0, 4, 4, 1, 6, 7, 3, 1, 3, 6, 6, 2, 3, 3, 1, 1, 3, 1, 4, 6, 5, 3, 6, 7, 3, 1, 3, 3, 3, 0, 3, 1, 2, 0, 4, 1, 1, 5, 6, 5, 7, 0, 0, 7, 4, 6, 0, 2, 7, 0, 6, 2, 1, 7, 3, 7, 2, 3, 5, 2, 2, 2, 1, 0, 2, 0, 3, 2, 4, 0, 3, 5, 0, 7, 4, 4, 6, 2, 2, 7, 0, 6, 1, 2, 2, 0

Offset

1,3

Links

Antti Karttunen, Table of n, a(n) for n = 1..65536

Formula

a(n) = A010877(A268819(n)) = A268819(n) mod 8.

Prog

(Scheme)
(define (A290108 n) (modulo (A268819 n) 8))
;; For the rest of code, follow A268819 and A268728.

Crossrefs

Cf. A010877, A165471, A268728, A268819, A269157.

Sequence in context: A197807 A111074 A007384 * A334950 A171419 A077574

Adjacent sequences: A290105 A290106 A290107 * A290109 A290110 A290111

Keyword

nonn

Author

Antti Karttunen, Sep 11 2017

Status

approved