The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A091850 a(1) = 1; a(n) is the smallest positive integer not already in the sequence such that Sum_{k=1..n} k*a(k) is a prime. 1
 1, 2, 4, 3, 6, 5, 12, 7, 16, 9, 14, 13, 8, 11, 10, 17, 18, 15, 22, 24, 20, 23, 26, 25, 30, 28, 32, 33, 38, 29, 48, 27, 34, 44, 36, 19, 42, 47, 52, 35, 50, 21, 56, 53, 46, 39, 60, 45, 54, 31, 40, 37, 58, 49, 70, 55, 68, 61, 72, 43, 98, 41, 74, 57, 84, 59, 78, 64, 82 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Proposed by Leroy Quet, Feb 13 2004; computed by several people including Fred W. Helenius, Feb 14 2004. Comment from Fred Helenius: Every positive integer up to 82 appears in the first 100 terms; everything up to 922 appears in the first 1000. Apart from a(1), odd-indexed terms must be even; even-indexed terms are occasionally even as well, so the odd values tend to arrive late. LINKS PROG (PARI) v=[1]; n=1; while(n<100, s=n*(#v+1)+sum(i=1, #v, i*v[i]); if(isprime(s)&&!vecsearch(vecsort(v), n), v=concat(v, n); n=0); n++); v \\ Derek Orr, Jun 03 2015 CROSSREFS Cf. A091851. Sequence in context: A193298 A168007 A328108 * A245454 A143273 A141429 Adjacent sequences:  A091847 A091848 A091849 * A091851 A091852 A091853 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, Mar 13 2004 STATUS approved

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

Last modified January 17 20:36 EST 2020. Contains 330987 sequences. (Running on oeis4.)