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.

A080021 log(n) is closer to an integer than is log(m) for any m with 2<=m

Original entry on oeis.org

2, 3, 7, 20, 148, 403, 1096, 1097, 2980, 2981, 8103, 59874, 162755, 442413, 1202604, 3269017, 8886110, 8886111, 24154952, 24154953, 65659969, 178482301, 3584912846, 9744803446, 26489122130, 72004899337, 195729609428
Offset: 1

Views

Author

Dean Hickerson, Jan 20 2003

Keywords

Comments

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

Examples

			log(2) = 1-0.306..., log(3) = 1+0.0986..., log(7) = 2-0.0540..., log(20) = 3-0.00426...
		

References

Crossrefs

Programs

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

Extensions

More terms from Don Reble, Jan 20 2003