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!)
A073884 a(1) =2. Let S(k) = sum of k terms. If S(n) is prime then a(n+1) is the smallest prime not included earlier else a(n+1) is the smallest composite number not included earlier. 0

%I #4 Dec 05 2013 19:55:32

%S 2,3,5,4,6,8,9,7,10,12,14,15,16,18,20,11,21,13,22,24,25,26,27,28,30,

%T 32,33,34,35,36,38,39,40,42,44,45,46,48,49,17,50,51,52,54,55,56,57,58,

%U 60,19,62,63,64,65,66,68,69,70,23,72,74,75,29,76,77,78,80,81,82,84,85,31

%N a(1) =2. Let S(k) = sum of k terms. If S(n) is prime then a(n+1) is the smallest prime not included earlier else a(n+1) is the smallest composite number not included earlier.

%K nonn

%O 0,1

%A _Amarnath Murthy_, Aug 17 2002

%E Corrected and extended by _Sean A. Irvine_, Nov 29 2009

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 June 5 02:01 EDT 2023. Contains 363130 sequences. (Running on oeis4.)