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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A095093 Number of 4k+3 primes whose Legendre-vector is not Dyck-path (A095103) in range ]2^n,2^(n+1)]. 6
 0, 0, 0, 1, 1, 3, 6, 12, 21, 41, 77, 143, 287, 530, 1010, 1967, 3711, 7125, 13806, 26525, 51126 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 LINKS A. Karttunen and J. Moyer, C-program for computing the initial terms of this sequence FORMULA a(n) = A095008(n) - A095092(n). PROG (PARI) is(m) = {my(s=0); if(isprime(m), for(i=1, m-1, if((s+=kronecker(i, m))<0, return(1)))); 0; } a(n) = {my(c=0); forstep(m=2^n+3, 2^(n+1), 4, c+=is(m)); c; } \\ Jinyuan Wang, Jul 20 2020 CROSSREFS Cf. A095103. Sequence in context: A092176 A000991 A345028 * A280473 A333820 A139422 Adjacent sequences: A095090 A095091 A095092 * A095094 A095095 A095096 KEYWORD nonn,more AUTHOR Antti Karttunen, Jun 01 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 31 15:10 EDT 2023. Contains 361668 sequences. (Running on oeis4.)