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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A306502 a(n) is the index in primes of A306499(n), or 0 if A306499(n) = 0. 3
1, 102091236, 732722, 6181, 314, 1, 199, 3, 2, 128, 1, 5, 2, 1, 4, 7, 5, 1, 4, 3, 1, 6, 1, 2, 9, 4, 2, 1, 6, 8, 1, 9, 7, 1, 3, 1, 4, 2, 1, 6, 2, 1, 8, 4, 1, 11, 11, 3, 7, 1, 6, 6, 2, 15, 1, 3, 2, 1, 12, 1, 15, 1, 3, 4, 1, 14, 1, 2, 5, 3, 2, 1, 10, 16, 1, 13, 1, 8, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

a(n) is the smallest integer k such that Sum_{i=1..k} Kronecker(A003658(n),prime(i)) > 0, or 0 if no such k exists.

See A306499 for the actual primes.

LINKS

Table of n, a(n) for n=1..79.

EXAMPLE

See A306499 for the example that shows a(16) = 7.

PROG

(PARI) b(n) = my(i=0); forprime(p=2, oo, i+=kronecker(n, p); if(i>0, return(p)))

for(n=1, 300, if(isfundamental(n), print1(primepi(b(n)), ", ")))

(Sage)

# Function 'KroneckerSum' is defined in A306499.

A306499 = KroneckerSum()

print([prime_pi(next(A306499)) for _ in range(77)]) # Peter Luschny, Feb 26 2019

CROSSREFS

Cf. A003658, A306499, A306503.

Sequence in context: A017648 A158214 A052096 * A218091 A293587 A263070

Adjacent sequences:  A306499 A306500 A306501 * A306503 A306504 A306505

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 26 05:51 EST 2020. Contains 332277 sequences. (Running on oeis4.)