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!)
 A306503 a(n) is the index in primes of A306500(n), or 0 if A306500(n) = 0. 3
 23338590792, 2946, 1, 2, 3, 1, 5, 2, 1, 3, 1, 5, 1, 5, 16, 1, 6, 7, 1, 2, 3, 38, 2, 1, 1, 5, 3, 1, 11, 11, 1, 1, 2, 9, 1, 13, 2, 1, 6, 15, 1, 3, 8, 4, 5, 1, 43, 1, 2, 8, 1, 1760, 2, 1, 10, 3, 1, 13, 29, 1, 5, 1, 11, 17, 2, 1, 8, 1, 5, 16, 1, 171, 33, 1, 4, 1, 2, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(n) is the smallest integer k such that Sum_{i=1..k} Kronecker(-A003657(n),prime(i)) > 0, or 0 if no such k exists. See A306500 for the actual primes. LINKS EXAMPLE See A306500 for the example that shows a(18) = 7. PROG (PARI) b(n) = my(i=0); forprime(p=2, oo, i+=kronecker(n, p); if(i>0, return(p))) print1(23338590792, ", "); for(n=4, 300, if(isfundamental(-n), print1(primepi(b(-n)), ", "))) CROSSREFS Cf. A003657, A306500, A306502. Sequence in context: A129250 A216398 A121841 * A096630 A297005 A233841 Adjacent sequences:  A306500 A306501 A306502 * A306504 A306505 A306506 KEYWORD nonn AUTHOR Jianing Song, Feb 19 2019 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 19 00:40 EST 2020. Contains 331030 sequences. (Running on oeis4.)