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.

Showing 1-1 of 1 results.

A192360 Numbers k such that number of primes in the range (k-sqrt(k), k) is equal to number of primes in the range (k, k+sqrt(k)).

Original entry on oeis.org

1, 4, 5, 6, 9, 12, 15, 17, 18, 19, 22, 25, 30, 35, 42, 51, 53, 54, 59, 60, 61, 64, 67, 68, 69, 72, 76, 77, 78, 81, 82, 83, 88, 89, 92, 104, 105, 106, 120, 132, 133, 134, 135, 136, 143, 144, 149, 150, 151, 152, 153, 154, 157, 161, 163, 164, 165, 166
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Jun 28 2011

Keywords

Crossrefs

Programs

  • Maple
    isA192360 := proc(n) plow := floor(n-sqrt(n)) ; phi := ceil(n+sqrt(n)) ; plow := numtheory[pi](n-1)-numtheory[pi](plow) ; phi := numtheory[pi] (phi-1)-numtheory[pi](n) ; plow = phi ; end proc:
    for n from 1 to 200 do if isA192360(n) then printf("%d,",n) ; end if; end do: # R. J. Mathar, Jul 02 2011
  • PARI
    isA192360(n)=my(s=sqrtint(n));2*primepi(n)-isprime(n)==if(n==s^2,primepi(n-s)+primepi(n+s-1),primepi(n-s-1)+primepi(n+s))

Extensions

3 removed by Charles R Greathouse IV, Jun 29 2011
Showing 1-1 of 1 results.