cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A095095 Number of A080115-primes in range [2^n,2^(n+1)].

Original entry on oeis.org

0, 0, 0, 3, 4, 9, 16, 33, 59, 107, 204, 376, 719, 1335, 2521, 4804, 9089, 17311, 33100, 63352, 121283
Offset: 1

Views

Author

Antti Karttunen, Jun 01 2004

Keywords

Crossrefs

Cf. A080115.

Programs

  • PARI
    is(p) = {my(s=0); if(isprime(p), for(i=1, (p-1)/2, if((s+=kronecker(i, p))<0, return(1)))); 0; }
    a(n) = sum(p=2^n+1, 2^(n+1), is(p)); \\ Jinyuan Wang, Jul 20 2020

Formula

a(n) = A036378(n) - A095094(n).