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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022834 a(n) = c(1)p(3) + ... + c(n)p(n+2), where c(i) = 1 if a(i-1) <= p(i+2) and c(i) = -1 if a(i-1) > p(i+2) (p(i) = primes). 0

%I #11 May 22 2019 06:26:48

%S 5,12,1,14,31,12,35,6,37,74,33,76,29,82,23,84,17,88,15,94,11,100,3,

%T 104,1,108,217,104,231,100,237,98,247,96,253,90,257,84,263,82,273,80,

%U 277,78,289,66,293,64,297,58,299,48,305,42,311,40,317,36,319,26,333

%N a(n) = c(1)p(3) + ... + c(n)p(n+2), where c(i) = 1 if a(i-1) <= p(i+2) and c(i) = -1 if a(i-1) > p(i+2) (p(i) = primes).

%K nonn

%O 0,1

%A _Clark Kimberling_

%E Missing a(45)=66 inserted and name corrected by _Sean A. Irvine_, May 21 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 10:29 EDT 2024. Contains 371905 sequences. (Running on oeis4.)