BBC Russian

A275720

a(1) = 0; for n > 1, if A003961(n) > A003961(n-1) then a(n) = a(n-1) + 1, otherwise if A003961(n) < A003961(n-1), then a(n) = a(n-1) - 1.

0, 1, 2, 3, 2, 3, 2, 3, 2, 1, 0, 1, 0, 1, 2, 3, 2, 3, 2, 3, 2, 1, 0, 1, 0, 1, 2, 1, 0, 1, 0, 1, 0, -1, 0, 1, 0, 1, 2, 3, 2, 3, 2, 3, 4, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1, 0, 1, 0, 1, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 4, 3, 2, 3, 2, 3, 4, 3, 2, 3, 2, 3, 4, 5, 4, 5, 4, 5, 4, 3, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 4, 3, 4, 5

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

OFFSET

1,3

LINKS

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

FORMULA

a(1) = 0; for n > 1, if A003961(n) > A003961(n-1) then a(n) = a(n-1) + 1, otherwise if A003961(n) < A003961(n-1), then a(n) = a(n-1) - 1.

PROG

(Scheme, with memoization-macro definec)

(definec (A275720 n) (if (= 1 n) 0 (+ (A275720 (- n 1)) (if (> (A003961 n) (A003961 (- n 1))) 1 -1))))

CROSSREFS

Cf. A003961, A275717, A275718, A275721, A275722.