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.

A135325 Smallest n such that pi(n)=Floor[n/log((n-pi(n))/e)].

Original entry on oeis.org

59473, 59671, 59699, 59707, 59729, 59743, 59747, 59755, 59771, 59779, 59791, 59799, 59810, 152993, 153001, 155801, 155809, 155821, 155833, 155849, 155853, 155877, 155889, 155913, 155925, 210533, 211891, 211933, 211943, 211949, 211969
Offset: 1

Views

Author

Manuel Valdivia, Dec 07 2007

Keywords

Crossrefs

Programs

  • Mathematica
    j=0;Do[k=Floor[n/Log[(n-PrimePi[n])/E]];If[PrimePi[n]==k&&k>j,Print[n];j=k],{n,1,10^7,1}]