a(n) = c(1)p(1) + ... + c(n)p(n), where c(i) = 1 if a(i-1) <= p(i) and c(i) = -1 if a(i-1) > p(i), for i = 1,...,n (p(i) = primes).

A022831

a(n) = c(1)p(1) + ... + c(n)p(n), where c(i) = 1 if a(i-1) <= p(i) and c(i) = -1 if a(i-1) > p(i), for i = 1,...,n (p(i) = primes).

Terms

    a(0) =2a(1) =5a(2) =10a(3) =3a(4) =14a(5) =1a(6) =18a(7) =37a(8) =14a(9) =43a(10) =12a(11) =49a(12) =8a(13) =51a(14) =4a(15) =57a(16) =116a(17) =55a(18) =122a(19) =51a(20) =124a(21) =45a(22) =128a(23) =39a(24) =136a(25) =35a(26) =138a(27) =31a(28) =140a(29) =27

External references