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.

A080022 Numbers n such that log_pi(n) is closer to an integer than is log_pi(m) for any m with 2<=m

Original entry on oeis.org

2, 3, 10, 31, 306, 9488, 9489, 29808, 29809, 93648, 294204, 9122171, 28658146, 888582403, 8769956796, 27551631843, 86556004192, 854273519914, 2683779414318, 8431341691876, 26487841119103, 26487841119104
Offset: 1

Views

Author

Dean Hickerson, Jan 20 2003

Keywords

Comments

Every term is floor(pi^k)+r for some integers k and r with k>=1 and -1 <= r <= 1.

Examples

			log_pi(2) = 1-0.394..., log_pi(3) = 1-0.0402..., log_pi(10) = 2+0.0114..., log_pi(31) = 3-0.000176...
		

References

Crossrefs

Programs

  • PARI
    lista(nn) = {flmin = 1; for (i = 2, nn, li = log(i)/log(Pi); fli = abs(round(li) - li); if (fli < flmin, print1(i, ", "); flmin = fli;););} \\ Michel Marcus, Aug 29 2013